The Random Edge Rule on Three-Dimensional Linear Programs
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.
- Publication:
-
arXiv Mathematics e-prints
- Pub Date:
- January 2003
- DOI:
- 10.48550/arXiv.math/0301076
- arXiv:
- arXiv:math/0301076
- Bibcode:
- 2003math......1076K
- Keywords:
-
- Combinatorics;
- Optimization and Control;
- 90C05;
- 52B10;
- 68W20
- E-Print:
- 21 pages (10 pages extended abstract + 11 pages appendix)