Skip to main content
SpringerLink
Log in

Decomposition Techniques for MILP: Lagrangian Relaxation

  • Reference work entry
Encyclopedia of Optimization

Article Outline

Keywords

Lagrangian decomposition

  Aggregation Schemes

Practical Issues

  Choosing Among Alternate Relaxations

  Choice of Multipliers

Applications

See also

References

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 2,499.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Fisher ML (1981) The Lagrangean relaxation method for solving integer programming problems. Managem Sci, 27(1):1–18

    MATH  Google Scholar 

  2. Fisher ML (1985) An applications oriented guide to Lagrangean relaxation. Interfaces 15(2):10–21

    Google Scholar 

  3. Geoffrion AM (1974) Lagrangian relaxation and its uses in integer programming. Math Program Stud 2:82–114

    MathSciNet  Google Scholar 

  4. Glover F, Klingman D (1988) Layering strategies for creating exploitable structure in linear and integer programs. Math Program 40:165–182

    Article  MATH  MathSciNet  Google Scholar 

  5. Guignard M, Kim S (1987) Lagrangean decomposition: A model yielding stronger Lagrangean bounds. Math Program 39:215–228

    Article  MATH  MathSciNet  Google Scholar 

  6. Guignard M, Kim S (1987) Lagrangean decomposition for integer programming: Theory and applications. RAIRO Oper Res 21(4):307–323

    MATH  MathSciNet  Google Scholar 

  7. Jörsten K, Näsberg M, Smeds P (1985) Variable splitting–a new Lagrangean relaxation approach to some mathematical programming models. Techn Report Dept Math Linkoping Inst Technol, Sweden MAT-R-85-04

    Google Scholar 

  8. Reinoso H, Maculan N (1992) Lagrangean decomposition in integer linear programming: A new scheme. INFOR 30:1–5

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. SCA Technologies LLC, Pittsburgh, USA

    Viswanathan Visweswaran

Authors
  1. Viswanathan Visweswaran
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemical Engineering, Princeton University, Princeton, NJ, 08544-5263, USA

    Christodoulos A. Floudas

  2. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611-6595, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Visweswaran, V. (2008). Decomposition Techniques for MILP: Lagrangian Relaxation . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_114

Download citation

Publish with us

Policies and ethics

Search

Navigation