MATH 4080 - Linear Programming

Linear programming and its applications. This course will cover basic theory and applications of linear programming. The topics will include convex geometry, the simplex algorithm, and duality. The applications may include problems in the areas of network optimization, the transportation problem, the assignment problem, the diet problem, cluster analysis, L1 fits, game theory, and scheduling.

Prerequisites & Corequisites: Prerequisite: MATH 2300 or MATH 3740.

Credits: 3 hours