Abstract
A bound is given for the average length of a ‘lexicographic path’, a definition that is motivated by degeneracies encountered when using the randomized simplex method.
This is a preview of subscription content, log in via an institution to check access.
References
Th.M. Liebling, “On cases where the number of steps of the simplex method is a poisson variable”, TR 09, IFOR ETH-Zürich (1975).
P.O. Lindberg and S. Ólafsson, “On the length of simplex paths: The assignment case“,Mathematical Programming 30 (1984) 243–260.
N. Megiddo, “A note on degeneracy in linear programming”, Research Report RJ-4895, The IBM Almaden Research Center, San Jose, CA.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Balinski, M.L., Liebling, T.M. & Nobs, A.E. On the average length of lexicographic paths. Mathematical Programming 35, 362–364 (1986). https://doi.org/10.1007/BF01580885
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01580885