Subexponential lower bounds for randomized pivoting rules for the simplex algorithm

  • Authors:

  • Oliver Friedmann;Thomas Dueholm Hansen;Uri Zwick

  • Affiliations:

  • University of Munich, Munich, Germany;Aarhus University, Aarhus, Denmark;Tel Aviv University, Tel Aviv, Israel

  • Venue:
  • Proceedings of the forty-third annual ACM symposium on Theory of computing
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

The simplex algorithm is among the most widely used algorithms for solving linear programs in practice. With essentially all deterministic pivoting rules it is known, however, to require an exponential number of steps to solve some linear programs. No non-polynomial lower bounds were known, prior to this work, for randomized pivoting rules. We provide the first subexponential (i.e., of the form 2Ω(nα), for some α0) lower bounds for the two most natural, and most studied, randomized pivoting rules suggested to date. The first randomized pivoting rule considered is Random-Edge, which among all improving pivoting steps (or edges) from the current basic feasible solution (or vertex) chooses one uniformly at random. The second randomized pivoting rule considered is Random-Facet, a more complicated randomized pivoting rule suggested by Kalai and by Matousek, Sharir and Welzl. Our lower bound for the Random-Facet pivoting rule essentially matches the subexponential upper bounds given by Kalai and by Matousek et al Lower bounds for Random-Edge and Random-Facet were known before only in abstract settings, and not for concrete linear programs. Our lower bounds are obtained by utilizing connections between pivoting steps performed by simplex-based algorithms and improving switches performed by policy iteration algorithms for solving Markov Decision Processes (MDPs).