Prerequisites/Corequisites: Take MATH-306. (Required, Previous).
Credit Hours: Min: 3; Max:
Description: Nonlinear optimization topics including derivatives, partial derivatives, one-dimensional search techniques, multi-dimensional search techniques, both unconstrained and constrained optimization techniques including LaGrange Multipliers and Kuhn-Tucker Conditions, and specialized techniques. Emphasis is on optimization theory, numerical algorithms with error analysis, and solving applied problems.