Solving staircase linear programs by the simplex method, 2: Pricing
- 1 October 1983
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 25 (3) , 251-292
- https://doi.org/10.1007/bf02594780
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Solving staircase linear programs by the simplex method, 1: InversionMathematical Programming, 1982
- Dynamically restricted pricing in the simplex method for linear programmingMathematical Programming, 1982
- On the Bartels—Golub decomposition for linear programming basesMathematical Programming, 1977
- The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational resultsMathematical Programming, 1977
- A practicable steepest-edge simplex algorithmMathematical Programming, 1977
- Note—Nested Decomposition of a Dynamic Energy ModelManagement Science, 1977
- Optimal design of multi-stage structures: a nested decomposition approachComputers & Structures, 1975
- An exact update for Harris’ TREADPublished by Springer Nature ,1975
- Partially normalized pivot selection in linear programmingPublished by Springer Nature ,1975
- Pivot selection methods of the Devex LP codeMathematical Programming, 1973