The Random Edge Rule on Three-Dimensional Linear Programs

Details The Random Edge Rule on Three-Dimensional Linear Programs The Random Edge Rule on Three-Dimensional Linear Programs

2003-01-09

arxiv.org/abs/math/0301076v1

Mathematics

Combinatorics

21 pages (10 pages extended abstract + 11 pages appendix)

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

The Random Edge Rule on Three-Dimensional Linear Programs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Random Edge Rule on Three-Dimensional Linear Programs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Random Edge Rule on Three-Dimensional Linear Programs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-725079