Nonlinear Optimization

4 credits

Maximization and minimization of nonlinear functions, constrained and unconstrained; nonlinear programming problems and methods. Lagrange multipliers; Kuhn-Tucker conditions, convexity. Quadratic programming. Prerequisite: a minimum grade of 2.0 in either MATH 327 or MATH 334; and a minimum grade of 2.0 in either MATH 407 or MATH 464. Offered: W.