Sub-navigation links

Home > Courses > Sloan School of Management > Optimization Methods in Management Science

Calendar

SES # TOPICS KEY DATES
1 Introduction to operations research
2 Formulations of linear and nonlinear programs
3 Geometry of linear programs 1
4 Geometry of linear programs 2
5 The simplex method 1
6 The simplex method 2
7 Sensitivity analysis
8 Duality theory 1
9 Duality theory 2
10 Duality theory 3

Review session 1 held one day after Ses #10

Midterm exam 1 held two days after Ses #10
11 Game theory
12 Networks 1: Introduction and the shortest path problem
13 Networks 2: The maximum flow problem
14 Networks 3: The minimum cost flow problem
15 Networks 4: The network simplex algorithm
16 Networks 5: The multi-commodity flow problem
17 Introduction to integer programming
18 Integer programming formulations

Review session 2 held one day after Ses #18

Midterm exam 2 held two days after Ses #18
19 Integer programming technique 1: Branch and bound
20 Integer programming technique 2: Cutting planes
21 Decision trees 1
22 Decision trees 2
23 Case study discussion on diet problem and applications
24 The grand finale / final exam tips

Final exam review session held 1 day after Ses #24

Final exam held 1 week after Ses #24
 

Your use of the MIT OpenCourseWare site and course materials is subject to our Creative Commons License and other terms of use.

Creative Commons - some rights reserved
OCW Consortium