Skip to main content Accessibility help
Internet Explorer 11 is being discontinued by Microsoft in August 2021. If you have difficulties viewing the site on Internet Explorer 11 we recommend using a different browser such as Microsoft Edge, Google Chrome, Apple Safari or Mozilla Firefox.

Chapter 13: Lagrangean Decomposition

Chapter 13: Lagrangean Decomposition

pp. 119-128

Authors

, Carnegie Mellon University, Pennsylvania
Resources available Unlock the full potential of this textbook with additional resources. There are free resources and Instructor restricted resources available for this textbook. Explore resources
  • Add bookmark
  • Cite
  • Share

Extract

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.

Keywords

  • Lagrangean relaxation
  • Lagrangean decomposition
  • Lagrangean dual
  • complicating constraints

About the book

Access options

Review the options below to login to check your access.

Purchase options

eTextbook
US$111.00
Hardback
US$111.00

Have an access code?

To redeem an access code, please log in with your personal login.

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.

Also available to purchase from these educational ebook suppliers