MATH 484

• Course in Catalog
• List of Terms offered
• Register for Classes

Credit: 3 OR 4 hours.

Iterative and analytical solutions of constrained and unconstrained problems of optimization; gradient and conjugate gradient solution methods; Newton's method, Lagrange multipliers, duality and the Kuhn-Tucker theorem; and quadratic, convex, and geometric programming.

4 hours of credit requires approval of the instructor and department with completion of additional work of substance. 3 or 4 undergraduate hours. 3 or 4 graduate hours. Prerequisite: MATH 241 and one of MATH 257, MATH 415, or MATH 416.

• My Favorites
• My Schedule