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