Improved asymptotic analysis of the average number of steps performed by the self-dual simplex algorithm
- 1 June 1986
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 35 (2) , 140-172
- https://doi.org/10.1007/bf01580645
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- On the expected number of linear complementarity cones intersected by random and semi-random raysMathematical Programming, 1986
- Linear Programming in Linear Time When the Dimension Is FixedJournal of the ACM, 1984
- New results on the average behavior of simplex algorithmsBulletin of the American Mathematical Society, 1984
- On the average number of steps of the simplex method of linear programmingMathematical Programming, 1983
- The Problem of the Average Speed of the Simplex MethodPublished by Springer Nature ,1983
- Some Distribution-Independent Results About the Asymptotic Order of the Average Number of Pivot Steps of the Simplex MethodMathematics of Operations Research, 1982
- Mathematician Solves Simplex ProblemScience, 1982
- Bimatrix Equilibrium Points and Mathematical ProgrammingManagement Science, 1965