Linear Optimization

Undergraduate

This course will cover the graphical solution of two variable linear programs, the tableau simplex algorithm, the revised simplex algorithm, linear programming theory, sensitivity analysis, the transportation problem, the assignment problem and integer programming. (Prerequisite: MATH-2250 or consent of instructor.) (Antirequisite: INDE-3120.) (3 lecture hours per week.) 646 Winter 2027 Undergraduate Calendar