# 6.251[J] 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[J] will not be offered this semester. It will be instructed by D. Bertsimas and J. N. Tsitsiklis.

This class counts for a total of 12 credits. This is a graduate-level class.

In the Fall 2015 Subject Evaluations, 6.251[J] was rated 6.0 out of 7.0. You can find more information on MIT OpenCourseWare at the Introduction to Mathematical Programming site or on the 6.251[J] Stellar site.

MIT 6.251[J] Introduction to Mathematical Programming Related Textbooks

MIT 6.251[J] Introduction to Mathematical Programming On The Web