| dc.contributor.author | Bertsimas, Dimitris | en_US |
| dc.coverage.temporal | Fall 2004 | en_US |
| dc.date.issued | 2004-12 | |
| dc.identifier | 15.093-Fall2004 | |
| dc.identifier | local: 15.093 | |
| dc.identifier | local: 2.098 | |
| dc.identifier | local: IMSCP-MD5-eadde07b1707bc161146b56ad5a9111d | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/67658 | |
| dc.description.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). | en_US |
| dc.language | en-US | en_US |
| dc.relation | | en_US |
| dc.rights.uri | Usage Restrictions: This site (c) Massachusetts Institute of Technology 2011. Content within individual courses is (c) by the individual authors unless otherwise noted. The Massachusetts Institute of Technology is providing this Work (as defined below) under the terms of this Creative Commons public license ("CCPL" or "license") unless otherwise noted. The Work is protected by copyright and/or other applicable law. Any use of the work other than as authorized under this license is prohibited. By exercising any of the rights to the Work provided here, You (as defined below) accept and agree to be bound by the terms of this license. The Licensor, the Massachusetts Institute of Technology, grants You the rights contained here in consideration of Your acceptance of such terms and conditions. | en_US |
| dc.subject | principal algorithms | en_US |
| dc.subject | linear | en_US |
| dc.subject | network | en_US |
| dc.subject | discrete | en_US |
| dc.subject | nonlinear | en_US |
| dc.subject | dynamic optimization | en_US |
| dc.subject | optimal control | en_US |
| dc.subject | methodology and the underlying mathematical structures | en_US |
| dc.subject | simplex method | en_US |
| dc.subject | network flow methods | en_US |
| dc.subject | branch and bound and cutting plane methods for discrete optimization | en_US |
| dc.subject | optimality conditions for nonlinear optimization | en_US |
| dc.subject | interior point methods for convex optimization | en_US |
| dc.subject | Newton's method | en_US |
| dc.subject | heuristic methods | en_US |
| dc.subject | dynamic programming | en_US |
| dc.subject | optimal control methods | en_US |
| dc.subject | SMA 5213 | en_US |
| dc.subject | 2.098 | en_US |
| dc.subject | 15.093 | en_US |
| dc.title | 15.093 / 2.098 Optimization Methods (SMA 5213), Fall 2004 | en_US |
| dc.title.alternative | Optimization Methods (SMA 5213) | en_US |
