MATH 380 - Nonlinear Programming

Credit Hours: 3
Lecture Hours: 3
Lab Hours: 0

This course includes methods for unconstrained optimization such as golden section search method, gradient method, Newton’s method and conjugate direction method; and methods for constrained optimization, including Lagrange multipliers, Kuhn-Tucker Theory, and duality.
Prerequisite: MATH 251

Please click here for Book Information

Academic Catalog

MATH 380 - Nonlinear Programming