A new pivoting rule for solving various degeneracy problems
- 29 February 1992
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 11 (1) , 23-32
- https://doi.org/10.1016/0167-6377(92)90058-b
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- On the average length of lexicographic pathsMathematical Programming, 1986
- Shadow prices and sensitivity analysis in linear programming under degeneracyOR Spectrum, 1986
- On the structure of the set bases of a degenerate pointJournal of Optimization Theory and Applications, 1985
- A Note on Shadow Prices in Linear ProgrammingJournal of the Operational Research Society, 1984
- An improved vertex enumeration algorithmEuropean Journal of Operational Research, 1982
- An algorithm for determining all extreme points of a convex polytopeMathematical Programming, 1977
- New Finite Pivoting Rules for the Simplex MethodMathematics of Operations Research, 1977
- Cycling in the dual simplex algorithmNaval Research Logistics Quarterly, 1955
- The generalized simplex method for minimizing a linear form under linear inequality restraintsPacific Journal of Mathematics, 1955
- Optimality and Degeneracy in Linear ProgrammingEconometrica, 1952