Cross decomposition for mixed integer programming
- 930 Downloads
Many methods for solving mixed integer programming problems are based either on primal or on dual decomposition, which yield, respectively, a Benders decomposition algorithm and an implicit enumeration algorithm with bounds computed via Lagrangean relaxation. These methods exploit either the primal or the dual structure of the problem. We propose a new approach, cross decomposition, which allows exploiting simultaneously both structures. The development of the cross decomposition method captures profound relationships between primal and dual decomposition. It is shown that the more constraints can be included in the Langrangean relaxation (provided the duality gap remains zero), the fewer the Benders cuts one may expect to need. If the linear programming relaxation has no duality gap, only one Benders cut is needed to verify optimality.
Key wordsMixed Integer Programming Cross Decomposition Lagrangean Relaxation Benders Decomposition Decomposition
Unable to display preview. Download preview PDF.
- E. Balas and C. Bergthaller, “Benders method revisited”, Management Sciences Report 401, Carnegie-Mellon University (Pittsburgh, PA, 1977).Google Scholar
- G.W. Graves and T.J. Van Roy, “Decomposition for large scale linear and mixed integer linear programming”, Working Paper, Graduate School of Management. UCLA (Los Angeles, November 1979).Google Scholar
- D. McDaniel and M. Devine, “A modified Benders' partitioning algorithm for mixed integer programming”,Management Science (1977) 312–379.Google Scholar
- T.J. Van Roy, “A cross decomposition algorithm for capacitated facility location”, to appear inOperations Research.Google Scholar
- T.J. Van Roy, “Cross decomposition for large-scale mixed integer linear programming with applications to facility location on distribution networks”, doctoral dissertation, Applied Sciences, Katholieke Universiteit Leuven (1980).Google Scholar