Optimization I

Catalog description

Credits 3. 3 Lecture Hours. Fundamentals of mathematical analysis underlying theory of constrained optimizations for a finite number of variables, necessary and sufficient conditions for constrained extrema of equality constraint problems, sufficient conditions for fulfillment of constraint qualification, computational methods for concave programming problems and applications. Prerequisite: MATH 410 or approval of instructor.