We investigate the behavior of randomized simplex algorithms on special linear programs. For this, we develop combinatorial models for the Klee-Minty cubes [16] and similar linear programs with exponential decreasing paths. The analysis of two randomized pivot rules on the Klee-Minty cubes leads to (nearly) quadratic lower bounds for the complexity of linear programming with random pivots. Thus we disprove two bounds conjectured in the literature. At the same time, we establish quadratic upper bounds for random pivots on the linear programs under investigation. This motivates the question whether some randomized pivot rules possibly have quadratic worst-case behavior on general linear programs. 1
|
837
|
Combinatorial Optimization Algorithm and Complexity
– Papadimitriou, Steiglitz
- 1982
|
|
492
|
Linear Programming and Extensions
– Dantzig
- 1963
|
|
181
|
Convex Polytopes
– Grünbaum
- 1967
|
|
172
|
Linear Programming in Linear Time When the Dimension Is Fixed
– Megiddo
- 1984
|
|
127
|
A Subexponential Bound for Linear Programming
– Matouˇsek, Sharir, et al.
- 1992
|
|
110
|
How good is the simplex algorithm
– Klee, Minty
- 1972
|
|
108
|
The maximum number of faces of a convex polytope
– McMullen
- 1970
|
|
97
|
Lectures on Polytopes, Graduate Texts in Mathematics 152
– Ziegler
- 1995
|
|
68
|
A subexponential randomized simplex algorithm
– Kalai
- 1992
|
|
50
|
Shellable decompositions of cells and spheres
– Bruggesser, Mani
- 1971
|
|
40
|
The Simplex Method: A Probabilistic Analysis
– Borgwardt
- 1987
|
|
39
|
A las vegas algorithm for linear programming when the dimension is small
– Clarkson
- 1988
|
|
32
|
A quasi-polynomial bound for the diameter of graphs of polyhedra
– Kalai, Kleitman
- 1992
|
|
31
|
The d-step conjecture and its relatives
– Klee, Kleinschmidt
- 1987
|
|
30
|
New finite pivoting rules for the simplex method
– Bland
- 1977
|
|
16
|
A survey of linear programming in randomized subexponential time
– Goldwasser
- 1995
|
|
13
|
unbaum, Convex Polytopes
– Gr
- 1967
|
|
12
|
Notes on Bland’s pivoting rule
– Avis, Chvátal
- 1978
|
|
11
|
Deformed products and maximal shadows
– Amenta, Ziegler
- 1998
|
|
10
|
Paths on polytopes
– Larman
- 1970
|
|
9
|
Worst case complexity of the shadow vertex simplex algorithm, Report
– Goldfarb
- 1983
|
|
8
|
Paths on polyhedra
– Klee
- 1965
|
|
8
|
Combinatorial linear programming: Geometry can help
– Gartner
- 1998
|
|
7
|
The worst-case running time of the random simplex algorithm is exponential in the height
– Broder, Dyer, et al.
- 1995
|
|
7
|
Some results on random linear programs
– Kelly
- 1981
|
|
7
|
Schrijver: Theory of Linear and
– unknown authors
- 1986
|
|
7
|
Lower bounds for a subexponential optimization algorithm
– Matouˇsek
- 1994
|
|
6
|
What is the worst case behavior of the simplex algorithm
– Zadeh
- 1980
|
|
5
|
Deformed products and maximal shadows, Preprint 502/1996
– Amenta, Ziegler
- 1996
|
|
3
|
On the complexity of the simplex algorithm, in
– Goldfarb
- 1992
|
|
2
|
Murty: Computational complexity of parametric linear programming
– G
- 1980
|
|
2
|
The efficiency of the simplex method: a survey, Management Sci
– Shamir
- 1987
|
|
2
|
Hoke: Completely unimodal numberings of a simple polytope
– Williamson
- 1988
|
|
2
|
Randomized Optimization by Simplex Type Methods
– Gartner
- 1995
|
|
1
|
Deformed products and maximal shadows, in: "Advances in Discrete and Computational Geometry
– Ziegler
- 1998
|
|
1
|
Chv' atal: Notes on Bland's pivoting rule, in: "Polyhedral Combinatorics
– Avis
- 1978
|
|
1
|
elou: The number and average length of decreasing paths in the KleeMinty cube
– Bousquet-M'
- 1996
|
|
1
|
artner: Combinatorial Linear Programming: Geometry Can Help, in
– G
- 1998
|
|
1
|
artner: Randomized Optimization by Simplex Type Methods
– G
- 1995
|
|
1
|
Randomized simplex algorithms on Klee-Minty cubes
– artner
- 1994
|
|
1
|
Geometry of the Gass-Saaty parametric cost LP algorithm, Discrete Comput. Geometry 5
– Klee
- 1990
|
|
1
|
How good is the simplex algorithm?, in: "Inequalities III
– Klee
- 1972
|
|
1
|
sek: Lower bounds for a subexponential optimization algorithm
– Matou
- 1994
|
|
1
|
et al.: Randomized simplex algorithms on special linear programs, in preparation
– artner, Ziegler
- 1994
|
|
1
|
Note on the Klee-Minty cube, manuscript
– Henk
- 1993
|
|
1
|
Lectures on Polytopes, SpringerVerlag New York 1994, in preparation. Bernd G artner Institut fur Informatik Freie Universitat Berlin Takustr
– Ziegler
|
|
1
|
The number and average length of decreasing paths
– Bousquet-Mélou
- 1996
|
|
