|
Dec 21, 2024
|
|
|
|
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 Prereq: 510 or equiv; computer programming experience desirable.
Credits: (4)
Add to Portfolio (opens a new window)
|
|