A practicable steepest-edge simplex algorithm
- 1 December 1977
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 12 (1) , 361-371
- https://doi.org/10.1007/bf01593804
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Partially normalized pivot selection in linear programmingPublished 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
- A stabilization of the simplex methodNumerische Mathematik, 1971
- A decision rule for improved efficiency in solving linear programming problems with the simplex algorithmCommunications of the ACM, 1960