  The 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.
