Convex sets and functions, linear inequalities and combinatorial problems; topics in linear programming from fundamental theorems of simplex method through sensitivity analysis, duality, transportation and assignment problems.
Prerequisites:MATH 225 or permission of instructor.