ALTHOUGH any problem in linear programming can be solved by the simplex method, various other algorithms are in use, for special cases of linear program- ming problems. Their advantage is usually ...

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

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