Skip to main content
SpringerLink
Log in

Integer Programming: Lagrangian Relaxation

  • Reference work entry
Encyclopedia of Optimization

Article Outline

Keywords

Purpose of Relaxation

Lagrangian Relaxation

The Lagrangian Dual

Integer Programming

Solving the Dual

Further Reading and Extensions

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. Bazaraa MS, Sherali HD, Shetty CM (1993) Nonlinear programming: Theory and algorithms, 2nd edn. Wiley, New York

    MATH  Google Scholar 

  2. Boyer CB (1985) A history of mathematics. Princeton Univ. Press, Princeton

    MATH  Google Scholar 

  3. Edmonds J (1967) Optimum branchings. J Res Nat Bureau Standards (B) 71:233–240

    MathSciNet  MATH  Google Scholar 

  4. Everett III H (1963) Generalized Lagrange multiplier method for solving problems of optimum allocation of resources. Oper Res 11:399–417

    MATH  Google Scholar 

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

    MATH  Google Scholar 

  6. Geoffrion AM (1974) Lagrangean relaxation for integer programming. Math Program Stud 2:82–114

    MathSciNet  Google Scholar 

  7. Glover F (1968) Surrogate constraints. Oper Res 16:741–749

    MathSciNet  MATH  Google Scholar 

  8. Glover F (1975) Surrogate constraint duality in mathematical programming. Oper Res 23:434–451

    MathSciNet  MATH  Google Scholar 

  9. Greenberg H, Pierskalla WP (1970) Surrogate mathematical programming. Oper Res 18:924–939

    MathSciNet  MATH  Google Scholar 

  10. Grötschel M, Padberg MW (1985) Polyhedral theory. In: Lawler EL et al (eds) The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley, New York, pp 251–305

    Google Scholar 

  11. Guinard M (1995) Lagrangean relaxation: A short course. JORBEL 35:5–21

    Google Scholar 

  12. Hooker JN (2000) Logic-based methods for optimization: Combining optimization and constraint satisfaction. Wiley, New York

    MATH  Google Scholar 

  13. Nemhauser GL, Wolsey LA (1988) Integer and combinatorial optimization. Wiley, New York

    MATH  Google Scholar 

  14. Padberg MW, Grötschel M (1985) Polyhedral computations. In: Lawler EL et al (eds) The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley, New York, pp 307–360

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate School of Industrial Admin., Carnegie Mellon University, Pittsburgh, USA

    J. N. Hooker

Authors
  1. J. N. Hooker
    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

Hooker, J.N. (2008). Integer Programming: Lagrangian Relaxation . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_290

Download citation

Publish with us

Policies and ethics

Search

Navigation