MATH 357: Linear Programming
Course Description
Application and theory of linear programming. Primal and dual formulations, sensitivity analysis, simplex method, transportation algorithm, and the assignment problem. Students will learn modeling and how to apply linear programming to problems. Case studies are used. This course is appropriate for mathematics students as well as students from other fields. Prerequisite: MATH 256 with a grade of C or better.