Optimization Methods (SMA 5213), Fall 2004
| Rating: | Not rated yet |
| Rate item | |
| Type: | Course Related Materials |
| Grade Level: | Post-secondary |
Author: Bertsimas, Dimitris
Subject: Business, Science and Technology
Institution Name:
M.I.T.
Collection Name: MIT OpenCourseWare
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.
Details
Course Type: Full Course
Material Types: Activities and Labs, Assessments, Homework and Assignments, Lecture Notes, Syllabi
Media Formats: Text/HTML, Downloadable docs
Language: English
Additional Information
Geographic
Regional Relevance: All
