MA 331 - Operations Research I

4.00 credits.

A study of mathematical techniques and models used to solve problems from business, management, and various other areas. Topics include the structure of linear programming, the simplex method to solve linear programming, sensitivity analysis, linear programming duality and complementary slackness, linear programming modeling techniques; blending problems, minimum cost network flow problems, transportation problems, shortest path problems, and the structure of integer programming modeling. *Prerequisite(s): MA 201 or MA 321.