It is well-known that the Lagrangian dual of an Integer Linear Program (ILP) provides the same bound as a continuous relaxation involving the convex hull of all the optimal solutions of the Lagrangian relaxation. It is less often realized that this equivalence is effective, in that basically all known algorithms for solving the Lagrangian dual either naturally compute an (approximate) optimal solution of the "convexified relaxation", or can be modified to do so. After recalling these results we elaborate on the importance of the availability of primal information produced by the Lagrangian dual within both exact and approximate approaches to the original (ILP), using three optimization problems with different structure to illustrate some of the main points.
|Titolo:||About Lagrangian Methods in Integer Optimization|
|Anno del prodotto:||2005|
|Digital Object Identifier (DOI):||10.1007/s10479-005-3447-9|
|Appare nelle tipologie:||1.1 Articolo in rivista|