BibTeX
@MISC{Gillmann06therandom,
author = {Rafael Gillmann},
title = {THE RANDOM EDGE SIMPLEX ALGORITHM ON DUAL CYCLIC 4-POLYTOPES},
year = {2006}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
The simplex algorithm using the random edge pivot-rule on any realization of a dual cyclic 4-polytope with n facets does not take more than O(n) pivot-steps. This even holds for general abstract objective functions (AOF) / acyclic unique sink orientations (AUSO). The methods can be used to show analogous results for products of two polygons. In contrast, we show that the random facet pivot-rule is slow on dual cyclic 4-polytopes, i.e. there are AUSOs on which random facet takes at least Ω(n²) steps.
