skip to content

» MIT OpenCourseWare » Sloan School of Management » Introduction to Optimization, Spring 2002

Calendar

SESSION	TOPIC	REQUIRED READINGS
1	Introduction to Linear Programming	Case: Gemstone Tool Company Ch. 1: sections.1-3, 5
2	Brief Review of Linear Algebra and LP Formulations
3	Geometry of Linear Programming	Ch. 1: section 4
4	Simplex Method 1	Appendix A Section 5, and Ch. 2
5	Simplex Method 2	Ch. 2
6	Linear Programming Sensitivity Analysis I	Ch. 3: sections 1-5
7	Linear Programming Sensitivity Analysis II	Ch. 3: sections 7-8
8	Linear Programming Duality Theory I	Ch. 4: sections 1-5
9	Linear Programming Duality Theory II
10	Midterm I
11	Applications of Network Models	Ch. 8 sections 1-4
12	The Minimum Cost Flow Problem	Ch. 8 sections 5-8
13	Shortest Path Problems	Handout
14	Integer Programming Models	Ch. 9 sections 1-4
15	Solving Integer Programs I: Branch and Bound	Ch. 9 sections 5-7
16	Solving Integer Programs II: Cutting Planes	Ch. 9 section 8
17	Nonlinear Programming Models	Ch. 13 section 1-4, 9
18	Midterm II
19	Separable Programming	Ch. 13 section 5
20	Dynamic Programming I	Ch. 11
21	Dynamic Programming II	Ch. 11
22	Heuristics I	Handout
23	Heuristics II: Genetic Algorithms and extensions	Handout
24	Heuristics III: Very Large Scale Neighborhood Search	Handout
25	Subject Review