Main Profile

At A Glance

Optimization Methods

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 optim...

Start Date: Sep 01, 2009
Cost: Free

Contact

Optimization Methods's Full Profile

Overview

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.

Details

  • Dates: Sep 01, 2009 to Dec 20, 2009
  • Days of the Week: Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, Sunday
  • Level of Difficulty: Beginner
  • Size: Massive Open Online Course
  • Instructor: Prof. Dimitris Bertsimas
  • Cost: Free
  • Institution: MIT OCW

Provider Overview

About MIT OCW: MIT OpenCourseWare (OCW) is a web-based publication of virtually all MIT course content. OCW is open and available to the world and is a permanent MIT activity.

Latest Tweet

Questions about Optimization Methods

Want more info about Optimization Methods? Get free advice from education experts and Noodle community members.

  • Answer