MATH 310: Formulation and computation of linear programming problems: simplex method, duality, sensitivity analysis, computer solutions; integer programming; network flows with applications
Course Description
Formulation and computation of linear programming problems: simplex method, duality, sensitivity analysis, computer solutions; integer programming; network flows with applications. May not earn credit in both MATH 310 and MATH 309.