MATH 509 - Linear Programming and Applications

Credit Hours: 3
Lecture Hours: 3
Lab Hours: 0

An applications-oriented course developing some of the theories and computational techniques of linear programming - the simplex method, the concept of duality, and the Duality Theorem, matrix representation of the Simplex Algorithm, sensitivity analysis, integer programming - and applying them to transportation problems.
Prerequisite: MATH 372

Academic Catalog

MATH 509 - Linear Programming and Applications