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
    Comparison of bundle and classical column generation
    • 111
    • PDF
    The omnipresence of Lagrange
    • 36
    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
    Practical Methods of Optimization
    • 8,329
    • PDF
    Matrix analysis
    • 27,490
    • PDF
    Optimization by Vector Space Methods
    • 5,208
    • PDF
    Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
    • 3,169
    • PDF
    Interior-point polynomial algorithms in convex programming
    • 3,053
    • PDF
    Semidefinite Programming
    • 2,740
    • PDF
    Convex analysis and variational problems
    • 3,835
    • PDF
    Network flows - theory, algorithms and applications
    • 6,127
    • PDF
    Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
    • 926
    • PDF