How fast does the simplex method usually work? Or: the search for (stochastic) independence

DOI10.1515/dmvm-2014-0037zbMath1323.90036OpenAlexW2080043366MaRDI QIDQ2249095

Karl Heinz Borgwardt

Publication date: 8 July 2014

Published in: Mitteilungen der Deutschen Mathematiker-Vereinigung (DMV) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dmvm-2014-0037

zbMATH Keywords

linear programmingsimplex algorithmprobabilistic analysisaverage case complexity

Mathematics Subject Classification ID

Linear programming (90C05)

This page was built for publication: How fast does the simplex method usually work? Or: the search for (stochastic) independence