Completely unimodal numberings of a simple polytope
Discrete Applied Mathematics
A subexponential randomized simplex algorithm (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A survey of linear programming in randomized subexponential time
ACM SIGACT News
The worst-case running time of the random simplex algorithm is exponential in the height
Information Processing Letters
Linear programming, the simplex algorithm and simple polytopes
Mathematical Programming: Series A and B - Special issue: papers from ismp97, the 16th international symposium on mathematical programming, Lausanne EPFL
Diameter of polyhedra: limits of abstraction
Proceedings of the twenty-fifth annual symposium on Computational geometry
Parallel search algorithm for geometric constraints solving
ICVR'07 Proceedings of the 2nd international conference on Virtual reality
Diameter of Polyhedra: Limits of Abstraction
Mathematics of Operations Research
Subexponential lower bounds for randomized pivoting rules for the simplex algorithm
Proceedings of the forty-third annual ACM symposium on Theory of computing
Unique sink orientations of grids
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
A subexponential lower bound for the random facet algorithm for parity games
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Hi-index | 0.01 |
The RANDOM-FACET algorithm is a randomized variant of the simplex method which is known to solve any linear program with n variables and m constraints using an expected number of pivot steps which is subexponential in both n and m. This is the theoretically fastest simplex algorithm known to date if m ≈ n; it provably beats most of the classical deterministic variants which require exp(Ω(n)) pivot steps in the worst case. RANDOM-FACET has independently been discovered and analyzed ten years ago by Kalai as a variant of the primal simplex method, and by Matousek, Sharir, and Welzl in a dual form. The essential ideas and results connected to RANDOM-FACET Can be presented in a particularly simple and instructive way for the case of linear programs over combinatorial n-cubes. I derive an explicit upper bound of Σℓ=1n 1/ℓ1(??) ≤ exp(2 √n) - 1 on the expected number of pivot steps in this case, using a new technique of "fingerprinting" pivot steps. This bound also holds for generalized linear programs, similar flavors of which have been introduced and studied by several researchers. I then review an interesting class of generalized linear programs, due to Matousek, showing that RANDOM-FACET may indeed require an expected number of exp(Ω(√n)) pivot steps in the worst case. The main new result of the paper is a proof that all actual linear programs in Matousek's class are solved by RANDOM-FACET with an expected polynomial number of O(n2) pivot steps. This proof exploits a combinatorial property of linear programming which has only recently been discovered by Holt and Klee. The result establishes the first scenario in which an algorithm that works for generalized linear programs "recognizes" proper linear programs. Thus, despite Matousek's worst-case result, the question remains open whether RANDOM-FACET (or any other simplex variant) is a polynomial-time algorithm for linear programming. Finally, I briefly discuss extensions of the combinatorial cube results to the general case.