Steepest-edge simplex algorithms for linear programming
- 1 May 1992
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 57 (1-3) , 341-374
- https://doi.org/10.1007/bf01581089
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Implementing the simplex method for the Optimization Subroutine LibraryIBM Systems Journal, 1992
- Vector processing in simplex and interior methods for linear programmingAnnals of Operations Research, 1990
- Computing Sparse LU Factorizations for Large-Scale Linear Programming BasesINFORMS Journal on Computing, 1990
- An analysis of an available set of linear programming test problemsComputers & Operations Research, 1989
- A practicable steepest-edge simplex algorithmMathematical Programming, 1977
- USING THE STEEPEST-EDGE SIMPLEX ALGORITHM TO SOLVE SPARSE LINEAR PROGRAMSPublished by Elsevier ,1976
- An exact update for Harris’ TREADPublished by Springer Nature ,1975
- Pivot selection methods of the Devex LP codeMathematical Programming, 1973
- Updated triangular factors of the basis to maintain sparsity in the product form simplex methodMathematical Programming, 1972
- The Composite Simplex AlgorithmSIAM Review, 1965