Registrar Home | Registrar Search:
Home | Subject Search | Help | Symbols Help | Pre-Reg Help | Final Exam Schedule | My Selections

MIT Subject Listing & Schedule
IAP / Spring 2019 Search Results

Searched for: "15.081"    Subjects offered any term      

1 subject found.

15.081[J] Introduction to Mathematical Programming
______

Graduate (Fall)
(Same subject as 6.251[J])
Prereq: 18.06
Units: 4-0-8
______
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.
P. Jaillet