If you look through papers on the Ellipsoid Method, there is a large agreement, that the Ellipsoid Method, although theoretically polynomial, is in practice way slower than the Simplex Method. Apparently, I was not able to find a single article that really backs up this claim by a survey, a meta-survey, some instances or anything else.
Does anybody have such a paper at hand that really shows the practical superiority of the Simplex Method?



Survey on Compared Running Time: Ellipsoid Method vs. Simplex Method
It’s not a survey. Nevertheless, [this paper](http://www.sciencedirect.com/science/article/pii/016754198490019X) can be interesting as we can read in the abstract:


“The computer experiment compared the two algorithms performance in solving SX exponential time problems. This represented a best possible case (for KA) and a worst possible case (for SX).”


KA - Khachian's algorithm  

SX – simplex algorithm.


Unfortunately, I don’t have access to a copy of this paper.


