Corpus ID: 14369666

The Random Edge Rule on Three-Dimensional Linear Programs

@article{Kaibel2003TheRE,
  title={The Random Edge Rule on Three-Dimensional Linear Programs},
  author={Volker Kaibel and Raphael Mechtel and Micha Sharir and G{\"u}nter M. Ziegler},
  journal={arXiv: Combinatorics},
  year={2003}
}
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. 
1 Citations

Figures from this paper

LP-related Properties of Polytopes with Few Facets
Linear Programming is the problem of maximizing a linear function in d variables subject to n linear constraints. Its relevance arises from the huge number of optimization problems that can beExpand

References

SHOWING 1-7 OF 7 REFERENCES
One line and n points.
We analyze a randomized pivoting process involving one line and n points in the plane. The process models the behavior of the RANDOM-EDGE simplex algorithm on simple polytopes with n facets inExpand
Randomized Simplex Algorithms on Klee-Minty Cubes
TLDR
This work disproves two bounds (for the expected running time of the random-edge simplex algorithm on Klee-Minty cubes) conjectured in the literature and establishes quadratic upper bounds for the expected length of a path for asimplex algorithm with random pivots on the classes of linear programs under investigation. Expand
Convex and Linear Orientations of Polytopal Graphs
TLDR
For each fixed d -polytope and any acyclic orientation of its graph, it is proved there exist both convex and concave functions that induce the given orientation. Expand
Low order polynomial bounds on the expected performance of local improvement algorithms
  • C. Tovey
  • Mathematics, Computer Science
  • Math. Program.
  • 1986
We present a general abstract model of local improvement, applicable to such diverse cases as principal pivoting methods for the linear complementarity problem and hill climbing in artificialExpand
Lectures on Polytopes
Based on a graduate course given at the Technische Universitat, Berlin, these lectures present a wealth of material on the modern theory of convex polytopes. The clear and straightforwardExpand
Deformed products and maximal shadows
  • Advances in Discrete and Computational Geometry, B. Chazelle, J. E. Goodman, and R. Pollack, eds., vol. 223 of Contemporary Mathematics, Amer. Math. Soc., Providence RI
  • 1998
Some results on random linear programs
  • Methods Oper. Res.,
  • 1981