Optimization Methods in Management Science
Game theory 1: 2-person 0-sum, or constant sum (PDF)
- Introduction (PDF)
- Formulations of linear and non-linear programs (PDF)
- Geometry and visualizations of linear programs (PDF)
- The simplex method 1 (PDF)
- The simplex method 2 (PDF)
- Sensitivity analysis and shadow prices (PDF)
- Game theory 1: 2-person 0-sum, or constant sum (PDF)
- Game theory 2 (PDF)
- Discussion of projects; slack variables vs. artificial variables (PDF)
- Introduction to integer programming (PDF)
- Integer programming formulations (PDF)
- Integer programming techniques 1: branch and bound (PDF)
- Integer programming techniques 2: cutting planes (PDF)
- Integer programming formulations, again (PDF)
- Networks 1: Shortest path problem (PDF)
- Networks 2: Network flows (PDF - 1.4MB)
- Networks 3: Traveling salesman problem (PDF)
- Decision trees 1 (PDF)
- Decision trees 2: the value of information (PDF)
- Behavioral economics (PDF)
- Recitation 1 problems (PDF)
- Recitation 1 solutions (PDF)
- Recitation 2 problems (PDF)
- Recitation 2 solutions (PDF)
- Recitation 3 problems (PDF)
- Recitation 3 solutions (PDF)
- Recitation 4 problems (PDF)
- Recitation 4 solutions (PDF)
- Recitation 5 problems (PDF)
- Recitation 5 solutions (PDF)
- Recitation 6 problems (PDF)
- Recitation 6 solutions (PDF)
- Recitation 7 problems (PDF)
- Recitation 7 solutions (PDF)
- Recitation 8 problems
- Recitation 8 solutions (PDF)
- Recitation 9 problems (PDF)
- Recitation 9 solutions (PDF)
- Recitation 10 problems (PDF)
- Recitation 10 solutions (PDF)
- Problem Set 1 – Group 1 (PDF)
- Problem Set 1 solutions – Group 1 (PDF)
- Problem Set 2 – Group 1 (PDF)
- Problem Set 2 solutions – Group 1 (PDF)
- Problem Set 3 (PDF)
- Problem Set 4 (PDF)
- Problem Set 4 solutions (PDF)
- Problem Set 5 (PDF)
- Problem Set 5 solutions (PDF)
- Problem Set 6 (PDF)
- Problem Set 6 solutions (PDF)
