On the average number of steps of the simplex method of linear programming
- 1 October 1983
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 27 (3) , 241-262
- https://doi.org/10.1007/bf02591902
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Random polytopes: Their definition, generation and aggregate propertiesMathematical Programming, 1982
- Complexity of linear programmingOperations Research Letters, 1982
- The fundamental theorem of algebra and complexity theoryBulletin of the American Mathematical Society, 1981
- A new linear programming algorithm — better or worse than the Simplex Method?The Mathematical Intelligencer, 1980
- Osteoporosis: a cautionary noteScience, 1980
- On Algorithms for Solving f(x)=0Communications on Pure and Applied Mathematics, 1979
- Computational complexity of complementary pivot methodsPublished by Springer Nature ,1978
- A convergent process of price adjustment and global newton methodsJournal of Mathematical Economics, 1976
- The Solution of Systems of Piecewise Linear EquationsMathematics of Operations Research, 1976
- The Gauss-Bonnet theorem for Riemannian polyhedraTransactions of the American Mathematical Society, 1943