CROSS DECOMPOSITION APPLIED TO INTEGER PROGRAMMING-PROBLEMS - DUALITY GAPS AND CONVEXIFICATION IN PARTS

We study the lower bounds on the optimal objective function value of linear pure integer programming problems obtainable by the convexification in parts that results from using Benders' or cross decomposition, and the best lower bounds obtainable by the convexification resulting from Lagrangian relaxation together with subgradient optimization or Dantzig-Wolfe decomposition. A comparison shows that generalized Benders' and generalized cross decomposition yield the best of these bounds, while ordinary Benders' decomposition yields bounds that are sometimes better and sometimes worse than those of Lagrangian relaxation. However, cross decomposition can be used to automatically get the best of the two bounds. The conclusion of this paper is that cross decomposition can be useful for getting good lower bounds for pure integer programming problems, bounds that can be made better than those of the frequently used Lagrangian relaxation.