Optimization@MIT
Engineering Sciences 210 -- Mathematical Programming
Course Description: Introduction to basic optimization techniques. Linear programming: the simplex method and related algorithms, duality theory, interior-point methods. Unconstrained optimization, nonlinear programming, convexity.
Instructor: Donald G. M. Anderson
Prerequisites: Applied Mathematics 21a and 21b, or Mathematics 21a and 21b, and Applied Mathematics 120, or equivalent.
Back to Classes
Course Description: Introduction to basic optimization techniques. Linear programming: the simplex method and related algorithms, duality theory, interior-point methods. Unconstrained optimization, nonlinear programming, convexity.
Instructor: Donald G. M. Anderson
Prerequisites: Applied Mathematics 21a and 21b, or Mathematics 21a and 21b, and Applied Mathematics 120, or equivalent.
Suggestions, feedback? Please send your thoughts to optimization-www@mit.edu.