Abstract.
Lagrangian relaxation is usually considered in the combinatorial optimization community as a mere technique, sometimes useful to compute bounds. It is actually a very general method, inevitable as soon as one bounds optimal values, relaxes constraints, convexifies sets, generates columns etc. In this paper we review this method, from both points of view of theory (to dualize a given problem) and algorithms (to solve the dual by nonsmooth optimization).
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Lemaréchal, C. The omnipresence of Lagrange. 4OR 1, 7–25 (2003). https://doi.org/10.1007/s10288-002-0003-1
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/s10288-002-0003-1