Cross decomposition is a recent method for mixed integer programming problems, exploiting simultaneously both the primal and the dual structure of the problem, thus combining the advantages of Dantzig—Wolfe decomposition and Benders decomposition. Finite convergence of the algorithm equipped with some simple convergence tests has been proved. Stronger convergence tests have been proposed, but not shown to yield finite convergence.
In this paper cross decomposition is generalized and applied to linear programming problems, mixed integer programming problems and nonlinear programming problems (with and without linear parts). Using the stronger convergence tests finite exact convergence is shown in the first cases. Unbounded cases are discussed and also included in the convergence tests. The behaviour of the algorithm when parts of the constraint matrix are zero is also discussed. The cross decomposition procedure is generalized (by using generalized Benders decomposition) in order to enable the solution of nonlinear programming problems.
Key wordsCross decomposition convergence linear programming mixed integer programming nonlinear programming
Unable to display preview. Download preview PDF.
- J.F. Benders, “Partitioning procedures for solving mixed-variables programming problems,”Numerische Matematik 4 (1962) 238–252.Google Scholar
- R.E. Burkard, H.W. Hamacher and J. Tind, “On general decomposition schemes in mathematical programming,”Mathematical Programming Study 24 (1985) 238–252.Google Scholar
- G.B. Dantzig,Linear Programming and Extensions (Princeton University Press, Princeton, NJ, 1963).Google Scholar
- G.B. Dantzig and P. Wolfe, “Decomposition principle for linear programs,”Operations Research 8 (1960) 101–111.Google Scholar
- O.E. Flippo, A.H.G. Rinnooy Kan and G. Van der Hoek, “Duality and decomposition in general mathematical programming,” Report 8747/B, Erasmus University (Rotterdam, 1987).Google Scholar
- A.M. Geoffrion, “Generalized Benders decomposition,”Journal of Optimization Theory and Applications 10(4) (1972) 237–260.Google Scholar
- K. Holmberg, “Capacitated facility location with staircase costs,” Research Report LiTH-MAT-R-84-26, Linköping Institute of Technology (Linköping, 1984).Google Scholar
- K. Holmberg, “Decomposition in large scale mathematical programming,” PhD. Dissertation, Linköping Institute of Technology (Linköping, 1985).Google Scholar
- K. Holmberg, “Primal-dual subgradient optimization and cross decomposition with applications to the produce-or-purchase problem,” Research Report LiTH-MAT-R-88-16, Linköping Institute of Technology (Linköping, 1988).Google Scholar
- K. Holmberg and K.O. Jörnsten, “Cross decomposition applied to the stochastic transportation problem,”European Journal of Operational Research 17(3) (1984a) 361–368.Google Scholar
- K. Holmberg and K.O. Jörnsten, “Decomposition methods for relaxed gravity models,” Research Report LiTH-MAT-R-84-23, Linköping Institute of Technology (Linköping, 1984b).Google Scholar
- K. Holmberg, K.O. Jörnsten and S. Migdalas, “Decomposition methods applied to discrete network design,” LiTH-MAT/OPT-WP-86-7, Linköping Institute of Technology (Linköping, 1986).Google Scholar
- R.T. Rockafellar,Convex Analysis (Princeton University Press, Princeton, NJ, 1976).Google Scholar
- T.J. Van Roy, “Cross decomposition for mixed integer programming,”Mathematical Programming 25 (1983) 46–63.Google Scholar
- T.J. Van Roy, “A Cross decomposition algorithm for capacitated facility location,”Operations Research 34(1) (1986) 145–163.Google Scholar