15.093[J] Optimization Methods

Class Info

Introduces the principal algorithms for linear, network, discrete, robust, nonlinear, dynamic optimization and optimal control. Emphasizes methodology and the underlying mathematical structures. Topics include the simplex method, network flow methods, branch and bound and cutting plane methods for discrete optimization, optimality conditions for nonlinear optimization, interior point methods for convex optimization, Newton's method, heuristic methods, and dynamic programming and optimal control methods.

This class has 18.06 as a prerequisite.

15.093[J] will not be offered this semester. It will be instructed by D. Bertsimas and P. Parrilo.

Lecture occurs 2:30 PM to 4:00 PM on Tuesdays and Thursdays in 32-123.

This class counts for a total of 12 credits. This is a graduate-level class.

You can find more information on MIT OpenCourseWare at the Lecture Notes site.

MIT 15.093[J] Optimization Methods Related Textbooks
MIT 15.093[J] Optimization Methods On The Web
Lecture Notes
computational pdf dynamic cont volume i. dynamic programming and optimal control lecture notes dynamic programming and optimal control creative commons license

© Copyright 2015