The Random Edge Rule on Three-Dimensional Linear Programs
Combinatorics
2007-05-23 v1 Optimization and Control
Abstract
The worst-case expected length f(n) of the path taken by the simplex algorithm with the Random Edge pivot rule on a 3-dimensional linear program with n constraints is shown to be bounded by 1.3445 n <= f(n) <= 1.4943 n for large enough n.
Cite
@article{arxiv.math/0301076,
title = {The Random Edge Rule on Three-Dimensional Linear Programs},
author = {Volker Kaibel and Raphael Mechtel and Micha Sharir and Günter M. Ziegler},
journal= {arXiv preprint arXiv:math/0301076},
year = {2007}
}
Comments
21 pages (10 pages extended abstract + 11 pages appendix)