The Lagrangian Relaxation Method for Solving Integer Programming Problems

(This article originally appeared in Management Science, January 1981, Volume 27, Number 1, pp. 1-18, published by The Institute of Management Sciences.) One of the most computationally useful ideas of the 1970s is the observation that many hard integer programming problems can be viewed as easy problems complicated by a relatively small set of side constraints. Dualizing the side constraints produces a Lagrangian problem that is easy to solve and whose optimal value is a lower bound (for minimization problems) on the optimal value of the original problem. The Lagrangian problem can thus be used in place of a linear programming relaxation to provide bounds in a branch and bound algorithm. This approach has led to dramatically improved algorithms for a number of important problems in the areas of routing, location, scheduling, assignment and set covering. This paper is a review of Lagrangian relaxation based on what has been learned in the last decade.

[1]  George L. Nemhauser,et al.  Optimal set partitioning, matchings and lagrangian duality , 1979 .

[2]  Jerome Heath.  The Dual Algorithm , 1998 .

[3]  S. S. Sengupta,et al.  The traveling salesman problem , 1961 .

[4]  Richard M. Karp,et al.  The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..

[5]  Jeremy F. Shapiro,et al.  Generalized Lagrange Multipliers in Integer Programming , 2011, Oper. Res..

[6]  Laurence A. Wolsey,et al.  An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit , 1979, Oper. Res..

[7]  Dorit S. Hochbaum,et al.  Database Location in Computer Networks , 1980, JACM.

[8]  M. Fisher,et al.  Constructive Duality in Integer Programming , 1974 .

[9]  Toàn Phan Huy,et al.  A Branch-and-Bound Algorithm , 2000 .

[10]  Harvey J. Everett.  Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources , 1963 .

[11]  J. Shapiro.  A Survey of Lagrangian Techniques for Discrete Optimization. , 1979 .

[12]  H. Paul Williams.  The reformulation of two mixed integer programming problems , 1978, Math. Program..

[13]  Francesco Maffioli,et al.  Heuristically guided algorithm for k-parity matroid problems , 1978, Discret. Math..

[14]  J. Krarup,et al.  Sharp Lower Bounds and Efficient Algorithms for the Simple Plant Location Problem , 1977 .

[15]  P. Camerini,et al.  On improving relaxation methods by modified gradient techniques , 1975 .

[16]  Jamie J. Goode,et al.  The traveling salesman problem: A duality approach , 1977, Math. Program..

[17]  Ludo Gelders,et al.  Langrangean relaxations for a generalised assignments-type problem , 1976 .

[18]  R. Gomory,et al.  A Linear Programming Approach to the Cutting-Stock Problem , 1961 .

[19]  K. Spielberg,et al.  On a Production Allocation and Distribution Problem , 1978 .

[20]  Donald Erlenkotter,et al.  A Dual-Based Procedure for Uncapacitated Facility Location , 1978, Oper. Res..

[21]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

[22]  R. E. Marsten,et al.  The Boxstep Method for Large-Scale Optimization , 2011, Oper. Res..

[23]  Ralph E. Gomory,et al.  A Linear Programming Approach to the Cutting Stock Problem---Part II , 1963 .

[24]  Javier Etcheberry,et al.  The Set-Covering Problem: A New Implicit Enumeration Algorithm , 1977, Oper. Res..

[25]  Marshall L. Fisher,et al.  A dual algorithm for the one-machine scheduling problem , 1976, Math. Program..

[26]  Jean-Louis Goffin,et al.  On convergence rates of subgradient optimization methods , 1977, Math. Program..

[27]  M. Fisher,et al.  A multiplier adjustment method for the generalized assignment problem , 1986 .

[28]  Ulrich Dorndorf,et al.  A Branch-and-Bound Algorithm , 2002 .

[29]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

[30]  L. J. Savage,et al.  Three Problems in Rationing Capital , 1955 .

[31]  Claude-Alain Burdet,et al.  A Subadditive Approach to Solve Linear Integer Programs , 1977 .

[32]  P. Miliotis,et al.  Integer programming approaches to the travelling salesman problem , 1976, Math. Program..

[33]  A. M. Geoffrion,et al.  Lagrangean Relaxation Applied to Capacitated Facility Location Problems , 1978 .

[34]  H. P. Williams.  Experiments in the formulation of integer programming problems , 1974 .

[35]  H. Crowder,et al.  Cluster Analysis: An Application of Lagrangian Relaxation , 1979 .

[36]  L. Schrage.  Implicit representation of variable upper bounds in linear programming , 1975 .

[37]  John A. Muckstadt,et al.  An Application of Lagrangian Relaxation to Scheduling in Power-Generation Systems , 1977, Oper. Res..

[38]  W. D. Northup,et al.  USING DUALITY TO SOLVE DISCRETE OPTIMIZATION PROBLEMS: THEORY AND COMPUTATIONAL EXPERIENCE* , 1975 .

[39]  Godwin C. Ovuworie,et al.  Mathematical Programming: Structures and Algorithms , 1979 .

[40]  Jakob Krarup,et al.  Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problem , 1974, Math. Program..

[41]  George L. Nemhauser,et al.  Note--On "Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms" , 1979 .

[42]  A. M. Geoffrion.  Lagrangean Relaxation and Its Uses in Integer Programming , 1972 .

[43]  Richard M. Soland,et al.  A branch and bound algorithm for the generalized assignment problem , 1975, Math. Program..

[44]  Marshall L. Fisher,et al.  Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I , 1973, Oper. Res..