This chapter addresses the decomposition of MILP optimization problems that involve complicating constraints. It is shown that, by dualizing the complicating constraints, one can derive the Lagrangean relaxation that yields a lower bound to the optimal solution. It is also shown that, by duplicating variables, one can dualize the corresponding equalities yielding the Lagrangean decomposition method that can predict stronger lower bounds than the Lagrangean relaxationn. The steps involved in this decomposition method are described, and can be exended to NLP and MINLP problems.
Review the options below to login to check your access.
Log in with your Cambridge Aspire website account to check access.
If you believe you should have access to this content, please contact your institutional librarian or consult our FAQ page for further information about accessing our content.