Lagrangian Relaxation

@inproceedings{Lemarchal2001LagrangianR,
  title={Lagrangian Relaxation},
  author={C. Lemar{\'e}chal},
  booktitle={Computational Combinatorial Optimization},
  year={2001}
}
  • C. Lemaréchal
  • Published in
    Computational Combinatorial…
    2001
  • Computer Science, Mathematics
  • Lagrangian relaxation is a tool to find upper bounds on a given (arbitrary) maximization problem. Sometimes, the bound is exact and an optimal solution is found. Our aim in this paper is to review this technique, the theory behind it, its numerical aspects, its relation with other techniques such as column generation. 
    About Lagrangian Methods in Integer Optimization
    • 102
    • Highly Influenced
    • PDF
    Relaxation and decomposition methods for mixed integer nonlinear programming
    • 122
    On a primal-proximal heuristic in discrete optimization
    • 21
    The omnipresence of Lagrange
    • 36
    A Lagrangian bound for many-to-many assignment problems
    • 16
    • Highly Influenced
    • PDF
    A primal-proximal heuristic applied to the French Unit-commitment problem
    • 72
    • PDF

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 78 REFERENCES
    Semidefinite Relaxations and Lagrangian Duality with Application to Combinatorial Optimization
    • 83
    • PDF
    Practical Methods of Optimization
    • 8,324
    • PDF
    Convergence of some algorithms for convex minimization
    • 233
    Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
    • 3,168
    • PDF
    Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
    • 925
    • PDF
    Optimization by Vector Space Methods
    • 5,207
    • PDF
    A recipe for semidefinite relaxation for (0,1)-quadratic programming
    • 201
    • PDF
    A geometric study of duality gaps, with applications
    • 82
    Interior-point polynomial algorithms in convex programming
    • 3,050
    • PDF