On the average length of lexicographic paths

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.


Published in:
Mathematical Programming, 35, 362-364
Year:
1986
Note:
PRO 86.01
Laboratories:




 Record created 2006-02-13, last modified 2018-01-27


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)