Journal:Informatica
Volume 7, Issue 3 (1996), pp. 337–348
Abstract
In the application of Dantzig–Wolfe decomposition to block-angular linear programming problems with R natural blocks. it is possible to have from 1 to R subproblems structurally while solving all R independent subproblems computationally. Early literature on the topic was inconclusive regarding the relative merits of such formulations. This paper attempts clarification by characterizing the significance of the degree of decomposition as well as presenting extensive empirical results.