The omnipresence of Lagrange

The omnipresence of Lagrange

0.00 Avg rating0 Votes
Article ID: iaor20083358
Country: Netherlands
Volume: 153
Issue: 1
Start Page Number: 9
End Page Number: 27
Publication Date: Sep 2007
Journal: Annals of Operations Research
Authors:
Keywords: combinatorial optimization
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).

Reviews

Required fields are marked *. Your email address will not be published.