- search hit 1 of 1
The Simplex Algorithm in Dimension Three
Please always quote using this URN:urn:nbn:de:0296-matheon-120
- We investigate the worst-case behavior of the simplex algorithm on linear programs with 3 variables, that is, on 3-dimensional simple polytopes. Among the pivot rules that we consider, the “random edge” rule yields the best asymptotic behavior as well as the most complicated analysis. All other rules turn out to be much easier to study, but also produce worse results: Most of them show essentially worst-possible behavior; this includes both Kalai’s “random-facet” rule, which is known to be subexponential without dimension restriction, as well as Zadeh’s deterministic history-dependent rule, for which no non-polynomial instances in general dimensions have been found so far.
Author: | Volker Kaibel, Rafael Mechtel, Micha Shair, Günter M. Ziegler |
---|---|
URN: | urn:nbn:de:0296-matheon-120 |
Referee: | Martin Grötschel |
Document Type: | Preprint, Research Center Matheon |
Language: | English |
Date of first Publication: | 2004/02/01 |
Release Date: | 2003/12/15 |
Preprint Number: | 24 |