References
Abadie, J. M., andA. C. Williams: Dual and Parametric Methods in Decomposition. Recent Advances in Mathematical Programming (P. Wolfe andR. L. Graves, Eds.), pp. 149–158. New York: McGraw Hill 1963.
Beale, E. M. L.: The Simplex Method Using Pseudo-basic Variables for Structured Linear Programming Problems. Recent Advances in Mathematical Programming (P. Wolfe andR. L. Graves, Eds.), pp. 133–148. New York: McGraw Hill 1963.
Dantzig, G. B., andP. Wolfe: Decomposition Principle for Linear Programs. Operations Research8, 101–111 (1960). Also see: The Decomposition Algorithm for Linear Programs. Econometrica29, 767–778 (1961).
Gale, D.: The Theory of Linear Economic Models. New York: McGraw Hill 1960.
Rosen, J. B.: Convex Partition Programming. Recent Advances in Mathematical Programming (P. Wolfe andR. L. Graves), pp. 159–176. New York: McGraw Hill 1963.
Rosen, J. B.: Primal and Dual Aspects of Partition Programming. Presented at ORSA-TIMS Natl. Meeting, San Francisco, California, November 8, 1961.
Benders, J. F.: Partitioning Procedures for Solving Mixed Variables Programming Problems. Numerische Mathematik4, 238–252 (1962).
Author information
Authors and Affiliations
Additional information
This work was supported in part by Office of Naval Research Contract No 225(37) NR-044-211 at Stanford University. Reproduction in whole or in part is permitted for any purpose of the United States Government.
Rights and permissions
About this article
Cite this article
Rosen, J.B. Primal partition programming for block diagonal matrices. Numer. Math. 6, 250–260 (1964). https://doi.org/10.1007/BF01386073
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01386073