Advanced Search
DSpace@MIT

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

Research and Teaching Output of the MIT Community

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

Download
Alternative Title: Optimization Methods (SMA 5213)
Author: Bertsimas, Dimitris
Date Issued: 2004-12
Abstract:
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).
URI: http://hdl.handle.net/1721.1/67658
Other Identifiers: 15.093-Fall2004
Other Identifiers: 15.093
2.098
IMSCP-MD5-eadde07b1707bc161146b56ad5a9111d
Has Version: http://www.core.org.cn/OcwWeb/Sloan-School-of-Management/15-093Fall-2004/CourseHome/index.htm
Keywords: principal algorithms, linear, network, discrete, nonlinear, dynamic optimization, optimal control, methodology and the underlying mathematical structures, 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, dynamic programming, optimal control methods, SMA 5213, 2.098, 15.093, 521301, Management Science, General, 143701, Operations Research

Show full item metadata

Files in this item

Name Size Format Description
15-093-fall-2004/ ... 16.70Kb HTML

The following license files are associated with this item:

This item appears in the following Collection(s)

MIT-Mirage