Non-Lin&Dynamic Prog
Theory and methods required to solve nonlinear problems: Kuhn-Tucker theory, quadratic, separable and geometric programming gradient techniques, and dynamic programming. Methods of stochastic programming surveyed. Formulations and applications stressed, case examples presented. Prerequisite: M&I-Eng 620. Equivalent to Sch-Mgmt 822.