The omnipresence of Lagrange - Archive ouverte HAL Access content directly
Journal Articles Annals of Operations Research Year : 2007

The omnipresence of Lagrange


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).

Dates and versions

hal-00821335 , version 1 (09-05-2013)



Claude Lemaréchal. The omnipresence of Lagrange. Annals of Operations Research, 2007, 153 (1), pp.9-27. ⟨10.1007/s10479-007-0169-1⟩. ⟨hal-00821335⟩
275 View
0 Download



Gmail Facebook Twitter LinkedIn More