Facebook this Page (opens a new window)
Tweet this Page (opens a new window)
Add to Portfolio.

MATH 542 - Theory of Linear and Nonlinear Programming

Minimization of functions subject to equality and inequality constraints. Kuhn-Tucker theorem, algorithms for function minimization, such as steepest descent and conjugate gradient, and penalty function method. (Not a course in computer programming.)

Prerequisites
MATH 510 or equiv; computer programming experience desirable.

Credits: 4

Print-Friendly Page (opens a new window)
Add to Portfolio.
Close Window