| Class Number | Date | Topics | Reading | HW Assigned | HW Due |
|---|---|---|---|---|---|
| 1 | 9/5 | Introduction, Administration, Examples of mathematical programs | Chapter 1 | ||
| 2 | 9/10 | Formulation of LP, solving 2-d LPs graphically, extreme points, feasible and infeasible LPs | Chapter 3.1 -3.3, | ||
| R1 | 9/10 9/12 | Review of linear algebra | Chapter 2 | ||
| 3 | 9/12 CANCELLED | feasible/infeasible, unbounded lps, more examples | Some examples from remainder of chapter 3 | ||
| 9/14 (automatic extension until 9/17) | HW 1 | ||||
| 4 | 9/17 | Some examples, basic and non-basic variables, basic feasible sloutions. beginning of simplex algorithm | Chapter 4.1-4.6 | ||
| R2 | 9/17 9/19 | Examples of linear programs. (plus linear algebra on Wednesday) | |||
| 9/21 | HW 2 | ||||
| 5 | 9/24 | basic simplex algorithm | Chapter 4.1-4.6 | ||
| R3 | 9/24 9/26 | ||||
| 6 | 9/26 | simplex algorithm | Chapter 4.9-4.11 | ||
| 9/28 | HW 3 | ||||
| 7 | 10/1 | degeneracy, unrestricted variables, cycling | |||
| R4 | 10/1 10/3 | ||||
| 8 | 10/3 | 2-phase method, , recap of simplex, more examples of LP, solving LPs on computers | Chapter 4.7,4.15 | ||
| 10/5 | HW 4 | ||||
| 9 | 10/8 | more LP examples | Chapter 3 | ||
| R5 | 10/8 10/10 | ||||
| 10 | 10/10 | Goal programming | Chapter 4.14 | ||
| 10/12 | HW 5 | ||||
| 11 | 10/15 | Sensitivity Analysis, LINDO, computing an optimal basis | Chapter 5, 6.2 | ||
| R6 | 10/15 10/17 | ||||
| 12 | 10/17 | Sensitivity analysis, duality | Chapter 6.3-6.10 | ||
| 10/19 | HW 6 | ||||
| 13 | 10/22 | complimentary slackness, economic interpretations | Chapter 6.8-6.10 | ||
| R7 | 10/22 10/24 | ||||
| 14 | 10/24 | Transportation problems | Chapter 7.1-7.2 | ||
| 10/26 | HW 7 | ||||
| 15 | 10/29 | Assignment problem | Chapter 7.5 | ||
| R8 | 10/29 | Midterm Review | |||
| 16 | 10/31 | Midterm | |||
| 17 | 11/7 | Transportation simplex | Chapter 7.3 | ||
| R9 | 11/7 | ||||
| 11/9 | HW 8 | ||||
| 18 | 11/12 | Network models, max flow | Chapter 8.1,8.3 | ||
| R10 | 11/12 11/14 | ||||
| 19 | 11/14 | max flow min-cut theorem | |||
| 11/16 | HW 9 | ||||
| 20 | 11/19 | other flow problems, mincost, multicommodity flows | Chapter 8 | ||
| R11 | 11/19 11/21 | ||||
| 21 | 11/21 | Dynamic programming, knapsack | Chapter 13 | ||
| 22 | 11/26 | Dynamic programming, shortest paths | Chatper 8.2 | ||
| R12 | 11/26 | ||||
| 23 | 11/28 | Dijkstra, acyclic graphs, greedy algorithms | Chapter 8.2 | ||
| 11/30 | HW 10 | ||||
| 24 | 12/3 | CPM/PERT scheduling | Chapter 8.4 | ||
| R13 | 12/3 12/5 | ||||
| 25 | 12/5 | IP, branch and bound | Chapter 9 | ||
| 12/7 | HW 11 | ||||
| 26 | 12/10 | more IP examples, cutting planes, Advanced Topics | Chapter 9 | ||
| 12/17, 9AM | Final |