MAT 381 - Mathematics of Operations Research (4)

Solution of transportation, transshipment and assignment problems. Formulation and solution of network problems: maximal flow, minimal spanning tree, shortest route problems; PERT-CPM techniques. Introduction to dynamic and integer programming. Elements of game theory, solution of games by linear programming. Introduction to nonlinear programming: Kuhn-Tucker conditions, quadratic and convex programming; SUMP solution procedure.

Prerequisite(s): C or better in MAT 380 or consent of instructor.
Component(s): 4 lecture/problem-solving.
When Offered: W, odd years