MIT OpenCourseWare
  • OCW home
  • Course List
  • about OCW
  • Help
  • Feedback
  • Support MIT OCW

15.093 / 2.098 Optimization Methods (SMA 5213), Fall 2004

Euler, Lagrange problems in infinite dimensions.
Problems in infinite dimensions, calculus of variations, Lecture 1. (Image by Prof. Dimitris Bertsimas.)

Highlights of this Course

This course features a complete set of lecture notes and assignments with solutions.

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.

This course was also taught as part of the Singapore-MIT Alliance (SMA) programme as course number SMA 5213 (Optimisation Methods).

 

Staff

Instructor:
Prof. Dimitris Bertsimas

Course Meeting Times

Lectures:
Two sessions / week
1.5 hours / session

Recitations:
One session / week
1 hour / session

Level

Graduate

Additional Features

Download this course
Translations
   Chinese (Simplified)

Feedback

Send feedback about OCW or this course.