TY - RPRT
A1 - Küfer, Karl-Heinz
T1 - On the Variance of the Number of Pivot Steps Required by the Simplex Algorithm
N2 - Despite their very good empirical performance most of the simplex algorithm's variants require exponentially many pivot steps in terms of the problem dimensions of the given linear programming problem (LPP) in worst-case situtation. The first to explain the large gap between practical experience and the disappointing worst-case was Borgwardt (1982a,b), who could prove polynomiality on tbe average for a certain variant of the algorithm-the " Schatteneckenalgorithmus (shadow vertex algorithm)" - using a stochastic problem simulation.
T3 - Preprints (rote Reihe) des Fachbereich Mathematik - 238
Y1 - 1993
UR - https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/4874
UR - https://nbn-resolving.org/urn:nbn:de:hbz:386-kluedo-48744
ER -