Advertisement

Mathematical Programming

, Volume 39, Issue 2, pp 215–228 | Cite as

Lagrangean decomposition: A model yielding stronger lagrangean bounds

  • Monique Guignard
  • Siwhan Kim
Article

Abstract

Given a mixed-integer programming problem with two matrix constraints, it is possible to define a Lagrangean relaxation such that the relaxed problem decomposes additively into two subproblems, each having one of the two matrices of the original problem as its constraints. There is one Lagrangean multiplier per variable. We prove that the optimal value of this new Lagrangean dual dominates the optimal value of the Lagrangean dual obtained by relaxing one set of constraints and give a necessary condition for a strict improvement. We show on an example that the resulting bound improvement can be substantial. We show on a complex practical problem how Lagrangean decomposition may help uncover hidden special structures and thus yield better solution methodology.

Key words

Mixed-integer programming Lagrangean relaxation Lagrangean decomposition block-angularization Y-convexity Integrality Property bound improvement 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. O. Bilde and J. Krarup, “Bestemmelse af optimal beliggenhed af produktionssteder” Research Report, IMSOR, The Technical University of Denmark (1967).Google Scholar
  2. O. Bilde and J. Krarup, “Sharp Lower Bounds and Efficient Algorithms for the Simple Plant Location Problem,”Annals of Discrete Mathematics 1 (1977) 79–97.MathSciNetCrossRefzbMATHGoogle Scholar
  3. M.E. Dyer, “Calculating Surrogate Constraints,”Mathematical Programming 19 (1980) 255–278.MathSciNetCrossRefzbMATHGoogle Scholar
  4. D. Erlenkotter, “A Dual-Based Procedure for Uncapacitated Facility Location,”Operations Research 26 (1978) 992–1009.MathSciNetCrossRefzbMATHGoogle Scholar
  5. M.L. Fisher, R. Jaikumar and L. Van Wassenhove, “A Multiplier Adjustment Method for the Generalized Assignment Problem,”Management Science 32 (1986) 1095–1103.CrossRefzbMATHGoogle Scholar
  6. A. Frank, “A Weighted Matroid Intersection Algorithm,”Journal of Algorithms 2 (1981) 328–336.MathSciNetCrossRefzbMATHGoogle Scholar
  7. B. Gavish and H. Pirkul, “Efficient Algorithms for Solving Multiconstraint Zero-One Knapsack Problems to Optimality,”Mathematical Programming 31 (1985) 78–105.MathSciNetCrossRefzbMATHGoogle Scholar
  8. A. Geoffrion, “Lagrangean Relaxation and its Uses in Integer Programming,”Mathematical Programming Study 2 (1974) 82–114.MathSciNetCrossRefGoogle Scholar
  9. F. Glover and J. Mulvey, “The Equivalence of the 0–1 Integer Programming Problem to Discrete Generalized and Pure Network Models,” Report HBS 75-46, Harvard University (1975), alsoOperations Research 28 (1980) 829–933.CrossRefzbMATHGoogle Scholar
  10. F. Glover and D. Klingman, “Layering Strategies for Creating Exploitable Structure in Linear and Integer Programs,” Center for Business Decision Analysis Report 119 (1984, revised 1985).Google Scholar
  11. H.J. Greenberg and W.P. Pierskalla, “Surrogate Mathematical Programming,”Operations Research 18 (1970) 924–939.MathSciNetCrossRefzbMATHGoogle Scholar
  12. M. Guignard, “A Lagrangean Dual Ascent Method Based on (Separable) Relaxation Strengthened by Valid Inequalities (Illustrated for the Matching Problem),” Department of Statistics Report #54, University of Pennsylvania (1983).Google Scholar
  13. M. Guignard, “A Lagrangean Dual Ascent Method for Simple Plant Location Problems,” Department of Statistics Report #59, University of Pennsylvania (1984a), to appear inEuropean J. Oper. Res. Google Scholar
  14. M. Guignard, “Lagrangean Decomposition: An Improvement over Lagrangean and Surrogate Duals,” Department of Statistics Report #62, University of Pennsylvania (1984b).Google Scholar
  15. M. Guignard and S. Kim, “A Strong Lagrangean Relaxation for Capacitated Plant Locations Problems,” Department of Statistics Report #56, University of Pennsylvania (1983).Google Scholar
  16. M. Guignard and K. Opaswongkarn, “Lagrangean Ascent for the Capacitated Plant Location Problem,” Department of Statistics Report #57, University of Pennsylvania (1984).Google Scholar
  17. M. Guignard and M. Rosenwein, “An Application of Lagrangean Decomposition to the Resource Constrained Minimum Weighted Arborescence Problem,” AT&T Bell Laboratories Report (1987).Google Scholar
  18. M. Guignard and K. Spielberg “Separable Lagrangean Relaxation for Weakly-Linked Mixed Integer Programming Problems,”Methods of Operations Research 49 (1985) 239–253.MathSciNetzbMATHGoogle Scholar
  19. G.Y. Handler and I. Zang, “A Dual Algorithm for the Constrained Shortest Path Problem,”Networks 10 (1980) 293–310.MathSciNetCrossRefzbMATHGoogle Scholar
  20. K.O. Jörnsten, M. Näsberg and P.A. Smeds, “Variable splitting—A New Lagrangean Relaxation Approach to Some Mathematical Programming Models,” Department of Mathematics Report LiTHMAT-R-85-04, Linköping Institute of Technology, Sweden (1985).Google Scholar
  21. M.H. Karwan and R.L. Rardin, “Some Relationships between Lagrangean and Surrogate Duality in Integer Programming,”Mathematical Programming 18 (1979) 320–334.CrossRefzbMATHGoogle Scholar
  22. S. Kim, oral communication (1984).Google Scholar
  23. S. Kim, “Solving Single Side Constraint Problems in Integer Programming: the Inequality Case,” Department of Statistics, Report #60, University of Pennsylvania (1984).Google Scholar
  24. S. Kim, “Primal Interpretation of Lagrangean Decomposition” Department of Statistics Report #72, University of Pennsylvania (1985).Google Scholar
  25. M. Minoux, “Plus courts chemins avec contraintes: algorithmes et applications,”Annales des Télécommunications 30 (1975) 383–394.zbMATHGoogle Scholar
  26. M. Minoux, “Lagrangean Decomposition,” oral communication (1983).Google Scholar
  27. C. Ribeiro, “Algorithmes de Recherche de Plus Courts Chemins avec Contraintes: Etude Théorique, Implémentation et Parallélisation,” Doctoral Dissertation, Paris (1983).Google Scholar
  28. C. Ribeiro and M. Minoux, “Solving Hard Constrained Shortest Path Problems,” ORSA-TIMS Meeting, Dallas (1984).Google Scholar
  29. C. Ribeiro and M. Minoux, “Solving Hard Constrained Shortest Path Problems by Lagrangean Relaxation and Branch and Bound Algorithms,”Methods of Operations Research 53 (1986) 303–316.MathSciNetzbMATHGoogle Scholar
  30. F. Shepardson and R. Marsten, “A Lagrangean Relaxation Algorithm for the Two-Duty Period Scheduling Problem,”Management Science 26 (1980) 274–281.MathSciNetCrossRefzbMATHGoogle Scholar
  31. R. Wong, “A Dual Ascent Approach for Steiner Tree Problems on a Directed Graph,”Mathematical Programming 28 (1984) 271–287.MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© The Mathematical Programming Society, Inc. 1987

Authors and Affiliations

  • Monique Guignard
    • 1
  • Siwhan Kim
    • 1
  1. 1.Wharton SchoolUniversity of PennsylvaniaPhiladelphiaUSA

Personalised recommendations