The Complexity of Zadeh’s Pivot Rule

The Simplex algorithm is one of the most important algorithms in discrete optimization, and is the most used algorithm for solving linear programs in practice. In the last 50 years, several pivot rules for this algorithm have been proposed and studied. For most deterministic pivot rules, exponential lower bounds were found, while a probabilistic pivot rule exists that guarantees termination in expected subexponential time.

One deterministic pivot rule that is of special interest is Zadeh’s pivot rule since it was the most promising candidate for a polynomial pivot rule for a long time. In 2011, Friedmann proved that this is not true by providing an example forcing the Simplex algorithm to perform at least a subexponential number of iterations in the worst case when using Zadeh’s pivot rule. Still, it was not known whether Zadeh’s pivot rule might achieve subexponential worst case running time. Next to analyzing Friedmann’s construction in detail, we develop the first exponential lower bound for Zadeh’s pivot rule. This closes a long-standing open problem by ruling out this pivot rule as a candidate for a deterministic, subexponential pivot rule in several areas of linear optimization and game theory.