TU Darmstadt / ULB / TUprints

On Friedmann's subexponential lower bound for Zadeh's pivot rule

Disser, Yann ; Hopp, Alexander V. (2018):
On Friedmann's subexponential lower bound for Zadeh's pivot rule.
2. revised version, Darmstadt, [Report]

This is the latest version of this item.

[Disser, Hopp] On Friedmann's subexponential lower bound for Zadeh's pivot rule.pdf
Copyright Information: CC-BY-ND 4.0 International - Creative Commons, Attribution NoDerivs.

Download (519kB) | Preview
Item Type: Report
Title: On Friedmann's subexponential lower bound for Zadeh's pivot rule
Language: English

The question whether the Simplex method admits a polynomial time pivot rule remains one of the most important open questions in discrete optimization. Zadeh's pivot rule had long been a promising candidate, before Friedmann (IPCO, 2011) presented a subexponential instance, based on a close relation to policy iteration algorithms for Markov decision processes (MDPs). We investigate Friedmann's lower bound example and exhibit three flaws in the corresponding MDP: We show that (a) the initial policy for the policy iteration does not produce the required occurrence records and improving switches, (b) the specification of occurrence records is not entirely accurate, and (c) the sequence of improving switches used by Friedmann does not consistently follow Zadeh's pivot rule. In this paper, we resolve each of these issues by adapting Friedmann's construction. While the first two issues require only minor changes to the specifications of the initial policy and the occurrence records, the third issue requires a significantly more sophisticated ordering and associated tie-breaking rule that are in accordance with the Least-Entered pivot rule. Most importantly, our changes do not affect the macroscopic structure of Friedmann's MDP, and thus we are able to retain his original result.

Place of Publication: Darmstadt
Edition: 2. revised version
Classification DDC: 500 Naturwissenschaften und Mathematik > 510 Mathematik
Divisions: Exzellenzinitiative > Graduate Schools > Graduate School of Computational Engineering (CE)
04 Department of Mathematics > Optimization > Discrete Optimization
Date Deposited: 05 Nov 2018 11:09
Last Modified: 24 Jun 2022 18:01
URN: urn:nbn:de:tuda-tuprints-75572
URI: https://tuprints.ulb.tu-darmstadt.de/id/eprint/7557

Available Versions of this Item

Actions (login required)
View Item View Item