A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
A New Combination of Lagrangean Relaxation, Dantzig-Wolfe Decomposition and Benders Decomposition Methods for Exact Solution of the Mixed Integer Programming Problems
2019
Communications in Mathematics and Applications
The combinational technique of cross decomposition is a suitable one for exact solution of the mixed integer programming problems which uses simultaneously the advantages of Lagrangean relaxation, Dantzig-Wolfe decomposition and Benders decomposition methods for Minimization problem that each reinforces one another. The basic idea for this technique is the generation of suitable upper and lower bounds for the optimal value of the original problem at each iteration. In this paper, new cross
doi:10.26713/cma.v10i3.1116
fatcat:akrhvoo5rnbrhihhl5gs6hxhjm