Studies linear and nonlinear programming, the simplex method, duality, sensitivity, transportation, and network flow problems, some constrained and unconstrained optimization theory, and the Kuhn-Tucker conditions, as time permits. Same as MATH 5120 and APPM 4120. Prerequisites: Requires prerequisite course of MATH 3130 or MATH 3135 or APPM 3310 (minimum grade C-).
