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

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

The transportation method of linear programming is extended to a more general class of problem, for which the "stepping-stone method" of Charnes and Cooper fails. The method is applicable to various ...