0
(
ratings
)
1
students
Created by:
![Profile Photo](https://opencoursa.com/wp-content/uploads/avatars/809/62de1041c5027-bpfull.jpg)
Last updated:
September 20, 2022
Duration:
Unlimited Duration
FREE
This course includes:
Unlimited Duration
Badge on Completion
Certificate of completion
Unlimited Duration
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.
Course Curriculum
- Applications of linear optimization Unlimited
- Geometry of linear optimization Unlimited
- Simplex method I Unlimited
- Simplex method II Unlimited
- Duality theory I Unlimited
- Duality theory II Unlimited
- Sensitivity analysis Unlimited
- Robust optimization Unlimited
- Large scale optimization Unlimited
- Network flows I Unlimited
- Network flows II Unlimited
- Applications of discrete optimization Unlimited
- Branch and bound and cutting planes Unlimited
- Lagrangean methods Unlimited
- Heuristics and approximation algorithms Unlimited
- Dynamic programming Unlimited
- Applications of nonlinear optimization Unlimited
- Optimality conditions and gradient methods Unlimited
- Line searches and Newton’s method Unlimited
- Conjugate gradient methods Unlimited
- Affine scaling algorithm Unlimited
- Interior point methods Unlimited
- Semidefinite optimization I Unlimited
- Semidefinite optimization II Unlimited
About the instructor
5
5
Instructor Rating
1
Reviews
1520
Courses
1916
Students
![Profile Photo](https://opencoursa.com/wp-content/uploads/avatars/809/62de1041c5027-bpfull.jpg)
Massachusetts Institute of Technology