| 0 | Sep 4 |
1.1. The Linear Programming Problem |
| 1 | Sep 7 |
1.2. Matrix Notation |
| 2 | Sep 11 |
1.3. Geometry of Linear Programming Problems |
| 3 | Sep 14 |
1.4. The Extreme Point Theorem |
| 4 | Sep 18 |
1.5. Basic Solutions |
| 5 | Sep 21 |
2.1. The Simplex Method for Problems in Standard Form |
| 6 | Sep 25 |
2.1 (continued) |
| 7 | Sep 28 |
2.2. Degeneracy and Cycling |
| 8 | Oct 2 |
Review and catch up |
| 9 | Oct 5 |
Midterm 1 |
| 10 | Oct 9 |
2.3. Artificial Variables |
| 11 | Oct 12 |
2.3. Two-Phase Method |
| 12 | Oct 16 |
3.1. Duality |
| 13 | Oct 19 |
3.1. (continued) |
| 14 | Oct 23 |
3.2. The Duality Theorem |
| 15 | Oct 26 |
3.2. (continued) |
| 16 | Oct 30 |
3.3. Computational Relations between the Primal and Dual Problems |
| 17 | Nov 2 |
3.4. The Dual Simplex Method |
| 18 | Nov 6 |
Review and catch up |
| 19 | Nov 9 |
Midterm 2 |
| 20 | Nov 13 |
3.6. Sensitivity Analysis |
| 21 | Nov 16 |
3.6. (continued) |
| 22 | Nov 21 |
4.1. Examples |
| 23 | Nov 27 |
4.1. (continued) |
| 24 | Nov 30 |
4.2. Cutting Plane Methods |
| 25 | Dec 4 |
4.2. Mixed Integer Programming |
| 26 | Dec 7 |
4.3. Branch and Bound Methods |
| 27 | Dec 11 |
Review and catch up |