|
Linear Programming |
|
The Teach LP add-in provides instruction for three different
algorithms for solving linear programming. The first two are simplex
methods that traverse the boundary of the feasible polytope and the
last is an interior point method.
|
|||||||
|
The Tableau Primal Simplex
|
|||||||
Operations
Research Models and Methods
by Paul A. Jensen and Jon Bard, University of Texas, Copyright
by the Authors