Decomposition principles for solving large structured linear programs
By: notes for a course presented by Mathematica in Berkeley, California, April 24-26, 1963.
Published: 1964
Place of publication: Princeton, N.J
Language: eng
Subjects: Linear programming.
Table of contents: value: I. Combinatorial analysis of linear programs, by Q.W. Tucker.; value: II. Dual pairs of linear programs and simplex methods, by M.L. Balinski.; value: III. Economics of duality, by W.J. Baumol.; value: IV. Decomposition theory and algorithm, by G. Dantzig.; value: V. Decomposition, pricing for decentralization, and external economies, by W. J. Baumol and T. Fabian.; value: VI. Application of decomposition, by P. Wolfe.; value: VII. An experimental study of the simplex method, by W. Kuhn and R.E. Quandt.; value: VIII. Computer codes, by P. Wolfe.; value: IX. Decomposition by hand by staff.; value: X. Dictionary of linear programming terms, by A. Yaspan.