# The Complexity of the Simplex Method

@article{Fearnley2015TheCO, title={The Complexity of the Simplex Method}, author={John Fearnley and Rahul Savani}, journal={Proceedings of the forty-seventh annual ACM symposium on Theory of Computing}, year={2015} }

The simplex method is a well-studied and widely-used pivoting method for solving linear programs. When Dantzig originally formulated the simplex method, he gave a natural pivot rule that pivots into the basis a variable with the most violated reduced cost. In their seminal work, Klee and Minty showed that this pivot rule takes exponential time in the worst case. We prove two main results on the simplex method. Firstly, we show that it is PSPACE-complete to find the solution that is computed by… Expand

#### Supplemental Presentations

#### 29 Citations

The Simplex Algorithm Is NP-Mighty

- Mathematics, Computer Science
- ACM Trans. Algorithms
- 2019

#### References

SHOWING 1-6 OF 6 REFERENCES

The simplex method is strongly polynomial for deterministic Markov decision processes

- Mathematics, Computer Science
- SODA
- 2013

On Simplex Pivoting Rules and Complexity Theory

- Mathematics, Computer Science
- IPCO
- 2014

How easy is local search?

- Computer Science, Mathematics
- 26th Annual Symposium on Foundations of Computer Science (sfcs 1985)
- 1985

On the average number of steps of the simplex method of linear programming

- Mathematics, Computer Science
- Math. Program.
- 1983

Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time

- Mathematics, Computer Science
- STOC '01
- 2001

On the Complexity of the Policy Improvement Algorithm for Markov Decision Processes

- Computer Science
- INFORMS J. Comput.
- 1994