CSc I6200 Mathematical Programming II

Convex functions and convex sets. Gradient, conjugant gradient, and variable metric methods. Kuhn-Tucker and duality theory. Nonlinear programming algorithms. Integer programming, branch and bound methods. Dynamic programming.

Credits

3

Prerequisite

CSc I6100.

Contact Hours

3 hr./wk.