On the average number of steps of the simplex method of linear programming
- Cite this article as:
- Smale, S. Mathematical Programming (1983) 27: 241. doi:10.1007/BF02591902
- 547 Downloads
The goal is to give some theoretical explanation for the efficiency of the simplex method of George Dantzig. Fixing the number of constraints and using Dantzig's self-dual parametric algorithm, we show that the number of pivots required to solve a linear programming problem grows in proportion to the number of variables on the average.