MATH 381 - Linear Methods in Operations Research

(3.00)

Introduction to convex sets. Theory of linear programming. Applications to transportation and assignment problems. Introduction to graphs with applications to network problems, including shortest route and maximum flow problems. Introduction to game theory. Note: Credit will not be given for both MATH 380 and Math 381.

Components: Lecture
Requirement Group: You must have completed MATH 221 with a grade of C or better.