The Random Edge Rule on Three-Dimensional Linear Programs

Simple item page
dc.creatorKaibel, Volker
dc.creatorMechtel, Raphael
dc.creatorSharir, Micha
dc.creatorZiegler, Günter M.
dc.date2003-01-09
dc.date.accessioned2026-07-07T04:54:20Z
dc.date.available2026-07-07T04:54:20Z
dc.descriptionThe worst-case expected length f(n) of the path taken by the simplex algorithm with the Random Edge pivot rule on a 3-dimensional linear program with n constraints is shown to be bounded by 1.3445 n <= f(n) <= 1.4943 n for large enough n.
dc.description21 pages (10 pages extended abstract + 11 pages appendix)
dc.identifierhttps://arxiv.org/abs/math/0301076
dc.identifierhttp://arxiv.org/abs/math/0301076
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/66211
dc.subjectCombinatorics
dc.subjectOptimization and Control
dc.subject90C05; 52B10; 68W20
dc.titleThe Random Edge Rule on Three-Dimensional Linear Programs
dc.typetext

Files

Collections

arXiv