2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/66211The 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.21 pages (10 pages extended abstract + 11 pages appendix)CombinatoricsOptimization and Control90C05; 52B10; 68W20text