# 6.251 Introduction to Mathematical Programming

Class Info

Introduction to linear optimization and its extensions emphasizing both methodology and the underlying mathematical structures and geometrical ideas. Covers classical theory of linear programming as well as some recent advances in the field. Topics: simplex method; duality theory; sensitivity analysis; network flow problems; decomposition; integer programming; interior point algorithms for linear programming; and introduction to combinatorial optimization and NP-completeness.

This class has 18.06 as a prerequisite.

6.251 will not be offered this semester. It will be available in the Fall semester, and will be instructed by J. N. Tsitsiklis and D. Bertsimas.

Lecture occurs 1:00 PM to 2:30 PM on Tuesdays and Thursdays in 32-155.

This class counts for a total of 12 credits.

You can find more information on MIT OpenCourseWare at the Introduction to Mathematical Programming site or on the 6.251 Stellar site.

Required Textbooks

Save up to a ton by purchasing through MIT Textbooks!

MIT 6.251 Introduction to Mathematical Programming Related Textbooks

MIT 6.251 Introduction to Mathematical Programming On The Web

Related Classes

Tags