This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
35th Annual Symposium on Foundations of Computer Science (FOCS 1994)
Santa Fe, NM, USA
November 20-November 22
ISBN: 0-8186-6580-7
B. Gartner, Inst. fur Inf., Freie Univ. Berlin, Germany
We investigate the behavior of randomized simplex algorithms on special linear programs. For this, we develop combinatorial models for the Klee-Minty cubes (1972) and similar linear programs with exponential decreasing paths. The analysis of two most natural 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 lime, 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.
Index Terms:
quadratic worst-case behavior, randomized simplex algorithms, Klee-Minty cubes, linear programs, combinatorial models, quadratic lower bounds, complexity, quadratic upper bounds
Citation:
B. Gartner, G.M. Ziegler, "Randomized simplex algorithms on Klee-Minty cubes," focs, pp.502-510, 35th Annual Symposium on Foundations of Computer Science (FOCS 1994), 1994
Usage of this product signifies your acceptance of the Terms of Use.