Randomized Simplex Algorithms on Klee-Mintny Cubes

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. >

Authors

• Bernd Gärtner
• Günter M. Ziegler

Keywords

• Linear programming
• Upper bound
• Polynomials
• Simplex Algorithm
• Lower Bound
• Combined Model
• Specific Programs
• Objective Function
• Number Of Steps
• Quadratic Function
• Random Walk
• Random Vector
• Acyclic Graph
• Feasible Set
• Coordinate Transformation
• Test Problems
• Unique Source
• Linear Algebra
• Lowest Index
• Lexicographic
• Polytope
• Class Program
• Linear Programming Algorithm