MAT 308 - Linear Programming

3 Credit(s) DII

This course is a study of linear optimization with application to business and the sciences. Topics may include linear equations and inequalities, convex regions, the simplex algorithm, duality and minimax theorems, matrix games, transportation and assignment problems. Experience is provided in the computer solution of linear programming problems. Three lecture hours per week.
Prerequisite: MAT210 or MAT 220.