On the variance of the number of pivot steps required by the simplex algorithm

DOI10.1007/BF01415671zbMath0842.90082OpenAlexW4234149867MaRDI QIDQ4845092

Karl-Heinz Küfer

Publication date: 6 August 1996

Published in: [https://portal.mardi4nfdi.de/entity/Q3031760 ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research] (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01415671

zbMATH Keywords

shadow vertex algorithmasymptotic probabilistic analysis

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (2)

On the asymptotic average number of efficient vertices in multiple objective linear programming ⋮ A note on the distribution of the number of simplex iterations to optimality

Cites Work

• The simplex method. A probabilistic analysis
• The Efficiency of the Simplex Method: A Survey
• Sur L'enveloppe convexe des nuages de points aleatoires dans Rⁿ. I
• Unnamed Item

This page was built for publication: On the variance of the number of pivot steps required by the simplex algorithm