Lecture Notes · Lecture Notes
MIT OpenCourseWare
Introduction to Mathematical Programming
Art: Palmer, Edward, 1803-1872, Figures 113-123. Plate Electrical Machines, 1840 · Public domain
- Instructor
- Prof. Dimitris Bertsimas
- Term
- Fall 2009
- Level
- Graduate
- What's inside
- 1 lecture note · 1 reading · 35 other files · 3 web pages
- Materials open
- MIT OCW
About this course
Source: MIT OpenCourseWare 6.251J Introduction to Mathematical Programming, Fall 2009, Prof. Dimitris Bertsimas — original course page on ocw.mit.edu ↗. License: CC BY-NC-SA 4.0. Study order: MIT's own listing order, section by section. Taken from MIT's published course files, downloaded from ocw.mit.edu on September 23, 2026. How RedLectern is built.
Materials are grouped the way MIT organized them. A verified, course-wide order has not been established here.
Before you start
Prerequisites are not listed here. Check MIT's own syllabus for this course.
How this course was organized
What's here, and what isn't
- A lecture sequence of 25 items is confirmed. No assignments or exams were found for this course, so it stays as organized materials rather than a full course order.
Materials by section
Grouped by section, as MIT organized them. Not sequenced or ordered.
Readings
Lecture Notes
25 files
- Lecture 1 · Formulations Download
- Lecture 2 · Geometry I Download
- Lecture 3 · Geometry II Download
- Lecture 4 · Geometry III Download
- Lecture 5 · Simplex method I Download
- Lecture 6 · Simplex method II Download
- Lecture 7 · Simplex method III Download
- Lecture 8 · Simplex method IV Download
- Lecture 9 · Duality theory I Download
- Lecture 10 · Duality theory II Download
- Lecture 11 · Duality theory III Download
- Lecture 12 · Sensitivity analysis Download
- Lecture 13 · Robust optimization Download
- Lecture 14 · Large scale optimization I Download
- Lecture 15 · Large scale optimization II Download
- Lecture 16 · Network flows I Download
- Lecture 17 Download
- Lecture 18 · The Ellipsoid method Download
- Lecture 19 · Problems with exponentially many constraints Download
- Lecture 20 · Interior point methods I Download
- Lecture 21 · Interior point methods II Download
- Lecture 22 · Interior point methods III Download
- Lecture 23 · Semidefinite optimization Download
- Lecture 24 · Discrete optimization I Download
- Lecture 25 · Discrete optimization II Download
Recitations
8 files
- Session R1 · Introduction to mathematical programming · Files Download
- Session R2 · Linear algebra review · Files Download
- Session R3 · Geometry of linear programming · Files Download
- Session R4 · Simplex method · Files Download
- Session R5 · Duality theory · Files Download
- Session R6 · Network flows · Files Download
- Session R7 · Ellipsoid method · Files Download
- Session R8 · Semidefinite programming · Files Download
Other materials from this course
Course outline
Lecture Notes · Lecture Notes
Lecture 2: Geometry I
Lecture Notes · Lecture Notes
Lecture 3: Geometry II
Lecture Notes · Lecture Notes
Lecture 4: Geometry III
Lecture Notes · Lecture Notes
Lecture 5: Simplex method I
Lecture Notes · Lecture Notes
Lecture 6: Simplex method II
Lecture Notes · Lecture Notes
Lecture 7: Simplex method III
Lecture Notes · Lecture Notes
Lecture 8: Simplex method IV
Lecture Notes · Lecture Notes
Lecture 9: Duality theory I
Lecture Notes · Lecture Notes
Lecture 10: Duality theory II
Lecture Notes · Lecture Notes
Lecture 11: Duality theory III
Lecture Notes · Lecture Notes
Lecture 12: Sensitivity analysis
Lecture Notes · Lecture Notes
Lecture 13: Robust optimization
Lecture Notes · Lecture Notes
Lecture 14: Large scale optimization I
Lecture Notes · Lecture Notes
Lecture 15: Large scale optimization II
Lecture Notes · Lecture Notes
Lecture 16: Network flows I
Lecture Notes · Lecture Notes
Lecture 17: Network flows II Courtesy of Prof. Andreas Schulz. Used with permission.
Lecture Notes · Lecture Notes
Lecture 18: The Ellipsoid method
Lecture Notes · Lecture Notes
Lecture 19: Problems with exponentially many constraints
Lecture Notes · Lecture Notes
Lecture 20: Interior point methods I
Lecture Notes · Lecture Notes
Lecture 21: Interior point methods II
Lecture Notes · Lecture Notes
Lecture 22: Interior point methods III
Lecture Notes · Lecture Notes
Lecture 23: Semidefinite optimization
Lecture Notes · Lecture Notes
Lecture 24: Discrete optimization I
Lecture Notes · Lecture Notes
Lecture 25: Discrete optimization II
MIT OpenCourseWare, Prof. Dimitris Bertsimas, 6.251J Introduction to Mathematical Programming, Fall 2009.
License: CC BY-NC-SA 4.0 · Edition: Fall 2009 · Open the original course on OCW ↗
Organized by RedLectern, independent of MIT and not endorsed by MIT.
Per-resource rights are recorded on each resource; All-Rights-Reserved items are link-only, never mirrored.
