Optimization Methods

Diagram of nodes and paths in a network.

This course covers various techniques and algorithms for network optimization. (Image by Prof. Dimitris Bertsimas.)

Instructor(s)

MIT Course Number

15.093J / 6.255J

As Taught In

Fall 2009

Level

Graduate

Cite This Course

Course Features

Course Description

This course introduces the principal algorithms for linear, network, discrete, nonlinear, dynamic optimization and optimal control. Emphasis is on 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.

Other OCW Versions

Archived versions: Question_avt logo

Bertsimas, Dimitris. 15.093J Optimization Methods, Fall 2009. (MIT OpenCourseWare: Massachusetts Institute of Technology), http://ocw.mit.edu/courses/sloan-school-of-management/15-093j-optimization-methods-fall-2009 (Accessed). License: Creative Commons BY-NC-SA


For more information about using these materials and the Creative Commons license, see our Terms of Use.


Close