One widely studied simplex variant, based on para- metric programming, is the shadow vertex algorithm of Borgwardt. This method is known to be exponen- tial in the worst case (see Goldfarb), but under ...
P.Q. Pan, A MODIFIED BISECTION SIMPLEX METHOD FOR LINEAR PROGRAMMING, Journal of Computational Mathematics, Vol. 14, No. 3 (JULY 1996), pp. 249-255 ...
Roughly, we will cover the following topics (some of them may be skipped depending on the time available). Linear Programming: Basics, Simplex Algorithm, and Duality. Applications of Linear ...