Linear Programming. 3 credits

Catalog description

In-depth look at the theory and methodology of linear programming: Computational enhancements of the revised simplex method; sparse-matrix techniques, bounded variables and the dual simplex method. Alternative interior point methods described and computational complexity of various algorithms analyzed. Offered by Systems Engr & Operations Rsch . May not be repeated for credit.