Answers are grounded in this paper and cite their sources.
It has been a challenge for mathematicians to theoretically confirm the extremely good performance of simplex algorithms for linear programming. We have confirmed that a certain variant of the simplex method solves problems of order m X n in an expected number of steps which is bounded between two quadratic functions of the smaller dimension of the problem. Our probabilistic assumptions are rather weak.
No takes yet. Share an insight, caveat, or question.
Adler et al. (1984) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: