# A Simplex Variant Solving An m x d Linear Program in O(min(m squared, d squared)) Expected Number of Pivot Steps

### http://www2.eecs.berkeley.edu/Pubs/TechRpts/1983/CSD-83-158.pdf

We present a variant of the Simplex method which requires on the average at most 2(min(m,d)+1)-squared pivots to solve the linear program min cTx, Ax>=b, x>=0 with (A(epsilon)R)mxd. The underlying probabilistic distribution is assumed to be invariant under inverting the sense of any subset of the inequalities. In particular, this implies that under Smale's spherically symmetric model this variant requires an average of no more than 2(d+1)-squared pivots, independent of m, where d<=m.

BibTeX citation:

```@techreport{Adler:CSD-83-158,
Author = {Adler, Ilan and Karp, Richard and Shamir, Ron},
Title = {A Simplex Variant Solving An m x d Linear Program in O(min(m squared, d squared)) Expected Number of Pivot Steps},
Institution = {EECS Department, University of California, Berkeley},
Year = {1983},
Month = {Dec},
URL = {http://www2.eecs.berkeley.edu/Pubs/TechRpts/1983/5951.html},
Number = {UCB/CSD-83-158},
Abstract = {We present a variant of the Simplex method which requires on the average at most 2(min(m,d)+1)-squared pivots to solve the linear program min cTx, Ax>=b, x>=0 with (A(epsilon)R)mxd. The underlying probabilistic distribution is assumed to be invariant under inverting the sense of any subset of the inequalities. In particular, this implies that under Smale's spherically symmetric model this variant requires an average of no more than 2(d+1)-squared pivots, independent of m, where d<=m.}
}
```

EndNote citation:

```%0 Report