On the Status of Multistage Linear Programming Problems

In the first part special cases are presented. Typical of the multistage problems are those encountered in dynamic problems. If the time span is divided into periods, the initial inventory provides the input for activities that occur in the first period or first stage. The output from the first stage provides the inventory input for activities in the second period or stage, etc. [Dantzig, G. B. 1951. Programming of interdependent activities: Mathematical model, chapter II. T. C. Koopmans, ed. Activity Analysis of Production and Allocation. John Wiley and Sons, 19--33. Also Econometrica17 3--4 1949.]. In the general case, the need to solve large scale systems is considered, followed by a discussion on solving general block triangular systems that cover a vast majority of practical problems.

[1]  D. R. Fulkerson,et al.  Maximal Flow Through a Network , 1956 .

[2]  F. L. Hitchcock.  The Distribution of a Product from Several Sources to Numerous Localities , 1941 .

[3]  Richard Bellman,et al.  On the Theory of Dynamic Programming---A Warehousing Problem , 1956 .

[4]  George B. Dantzig,et al.  Optimal Solution of a Dynamic Leontief Model with Substitution , 1955 .

[5]  C. E. Lemke,et al.  Computational Theory of Linear Programming. 1. The Bounded Variables Problem , 1954 .

[6]  William Prager,et al.  Numerical solution of the generalized transportation problem , 1957 .

[7]  Richard Bellman.  Some Applications of the Theory of Dynamic Programming - A Review , 1954, Oper. Res..

[8]  Stuart E. Dreyfus.  An Analytic Solution of the Warehouse Problem , 1957 .

[9]  A. Tucker,et al.  Linear Inequalities And Related Systems , 1956 .

[10]  Abraham Charnes,et al.  Minimization of non-linear separable convex functionals† , 1954 .

[11]  E. M. L. Beale,et al.  An alternative method for linear programming , 1954, Mathematical Proceedings of the Cambridge Philosophical Society.

[12]  H. Markowitz.  The Elimination form of the Inverse and its Application to Linear Programming , 1957 .

[13]  G. Dantzig.  UPPER BOUNDS, SECONDARY CONSTRAINTS, AND BLOCK TRIANGULARITY IN LINEAR PROGRAMMING , 1955 .

[14]  C. E. Lemke,et al.  The dual method of solving the linear programming problem , 1954 .

[15]  A. Charnes,et al.  DUALITY, REGROUPING AND WAREHOUSING , 1954 .

[16]  D. R. Fulkerson,et al.  Solving a Transportation Problem , 1956 .

[17]  George B. Dantzig,et al.  A PRIMAL--DUAL ALGORITHM , 1956 .

[18]  George B. Dantzig,et al.  RECENT ADVANCES IN LINEAR PROGRAMMING , 1956 .

[19]  M. L. Juncosa,et al.  Optimal Design and Utilization of Communication Networks , 1956 .

[20]  Abraham Charnes,et al.  The Stepping Stone Method of Explaining Linear Programming Calculations in Transportation Problems , 1954 .