Solving staircase linear programs by the simplex method, 1: Inversion
- 1 December 1982
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 23 (1) , 274-313
- https://doi.org/10.1007/bf01583795
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- Matrix augmentation and structure preservation in linearly constrained control problemsMathematical Programming, 1980
- A TWO-LEVEL ALGORITHM FOR TWO-STAGE LINEAR PROGRAMSJournal of the Operations Research Society of Japan, 1978
- The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational resultsMathematical Programming, 1977
- A FAST, STABLE IMPLEMENTATION OF THE SIMPLEX METHOD USING BARTELS-GOLUB UPDATING††Research for this paper was supported by the Energy Research and Development Administration Contract AT(04-3)-326 PA #18, at Stanford University.Published by Elsevier ,1976
- The Partitioned Preassigned Pivot Procedure (P4)Published by Springer Nature ,1972
- A stabilization of the simplex methodNumerische Mathematik, 1971
- The simplex method of linear programming using LU decompositionCommunications of the ACM, 1969
- Optimal Solution of a Dynamic Leontief Model with SubstitutionEconometrica, 1955
- Upper Bounds, Secondary Constraints, and Block Triangularity in Linear ProgrammingEconometrica, 1955
- Programming of Interdependent Activities: II Mathematical ModelEconometrica, 1949