IEGR 620 - Nonlinear Programming

3 hours.
3 Credits

Theoretical development of solution methods in nonlinear programming including manifold suboptimization, convex simplex, reduced gradient, gradient projection, feasible direction, cutting plane, and penalty function methods. Investigation of convergence of algorithms. Methods of solution for integer programming problems including cutting plane methods, enumerative techniques, and dynamic programming methods.

Offered (AS NEEDED)