MATH 447

Nonlinear Programming

Units: 1.5

Hours: 3-0

Introduction to theory and algorithm of nonlinear programming. Topics may include: unconstrained optimization theory and iterative methods; Lagrange multipliers and Karush-Kuhn-Tucker theorem for constrained optimization problems; convex programming and duality, penalty function methods.


  • Credit will be granted for only one of MATH 447, MATH 491A (if taken in the same topic), MATH 492 (if taken in the same topic).


Undergraduate course in Mathematics offered by the Department of Mathematics and Statistics in the Faculty of Science.

Summer Fall Spring

Note that not all courses are offered in every term. If a course is not offered, the schedule page will alert you that "No classes were found that meet your search criteria."