Abstract
Suppose that a large-scale block-diagonal linear programming problem has been solved by the Dantzig—Wolfe decomposition algorithm and that an optimal solution has been attained. Suppose further that it is desired to perform a post-optimality analysis or a complete parametric analysis on the cost-coefficients or the RHS of the linking constraints. Efficient techniques for performing these analyses for the ordinary simplex case have not been easily applied to this case as one operation involves doing a minimizing ratio between all columns of two rows of the tableau. As the columns are not readily known in Dantzig—Wolfe decomposition, other techniques must be used. To date, suggested methods involve solving small linear programs to find these minimizing ratios. In this paper a method is presented which requires solving no linear programs (except possibly in the case of degeneracy of a subproblem) using and utilizing only the information typically stored for Dantzig—Wolfe decomposition.
Similar content being viewed by others
References
J.M. Abadie and A.C. Williams, “Dual and parametric methods in decomposition”, in: R.L. Graves and P. Wolfe, eds.,Recent advances in mathematical programming (McGraw-Hill, New York, 1963).
A. Charnes and W.W. Cooper, “Programming with linear fractionals”,Naval Research Logistics Quarterly 9 (1962) 181–186.
G.B. Dantzig,Linear programming and extensions (Princeton University Press, Princeton, N.J., 1963).
G.B. Dantzig and P. Wolfe, “Decomposition principle for linear programs”,Operations Research 8 (1960) 101–111.
L.S. Lasdon,Optimization theory for large systems (MacMillan, New York, 1970).
J.A. Lawrence, “Parametric programming with extensions to large scale algorithms”, Rept. ORC 73-18, Operations Research Center, University of California, Berkeley, Calif. (1973).
W. Orchard-Hays,Advanced linear programming computing techniques (McGraw-Hill, New York, 1968).
M. Simmonard,Linear programming, (Prentice-Hall, Englewood Cliffs, N.J., 1966).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Lawrence, J.A. A dual decomposition algorithm. Mathematical Programming 11, 177–193 (1976). https://doi.org/10.1007/BF01580385
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01580385