Practical finite pivoting rules for the simplex method
- 1 December 1990
- journal article
- Published by Springer Nature in OR Spectrum
- Vol. 12 (4) , 219-225
- https://doi.org/10.1007/bf01721801
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- On the choice of the pivot columns of the Simplex-method: Gradient criteriaComputing, 1987
- Worst case behavior of the steepest edge simplex methodDiscrete Applied Mathematics, 1979
- Letter to the Editor—On the Possibility of Cycling with the Simplex MethodOperations Research, 1978
- A practicable steepest-edge simplex algorithmMathematical Programming, 1977
- New Finite Pivoting Rules for the Simplex MethodMathematics of Operations Research, 1977
- The simplex algorithm with the pivot rule of maximizing criterion improvementDiscrete Mathematics, 1973
- A class of linear programming problems requiring a large number of iterationsNumerische Mathematik, 1965
- An experimental study of the simplex methodProceedings of Symposia in Applied Mathematics, 1963
- Optimality and Degeneracy in Linear ProgrammingEconometrica, 1952