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. Prereqs., APPM 3310 or MATH 3130. Same as APPM 5120 and MATH 4120.