Classes and homeworks will follow
the schedule below, although changes and adjustments are possible.
| Class # | Date | Topic | Reading | |
| 1 | 19-Jan | Tuesday | Introduction to Operations Research | Prologue |
| 2 | 21-Jan | Thursday | The Linear Programming Problem | 1.1 |
| 3 | 26-Jan | Tuesday | Review of Linear Algebra | 0.1 through 0.5 |
| 4 | 28-Jan | Thursday | Geometry in R^n | 1.3 |
| 5 | 2-Feb | Tuesday | Matrix Notation, Geometric Solutions | 1.2,1.3 |
| 6 | 4-Feb | Thursday | Extreme Points, Basic Feasible Solutions | 1.4,1.5 |
| 7 | 9-Feb | Tuesday | Simplex Method | 2.1 |
| 8 | 11-Feb | Thursday | Simplex Method | 2.2 |
| 9 | 16-Feb | Tuesday | Simplex Method | 2.3 |
| 10 | 18-Feb | Thursday | Economic Interpretation of Duality | 3.1 |
| 11 | 23-Feb | Tuesday | The Duality Theorem | 3.2,3.3 |
| 12 | 25-Feb | Thursday | Midterm 1 | |
| 13 | 2-Mar | Tuesday | The Dual Simplex Method | 3.4 |
| 14 | 4-Mar | Thursday | Revised Simplex Method | 3.5 |
| 15 | 9-Mar | Tuesday | Sensitivity Analysis | 3.6 |
| -- | 11-Mar | Thursday | Spring Break | |
| -- | 16-Mar | Tuesday | Spring Break | |
| 16 | 18-Mar | Thursday | Integer Programming Examples | 4.1 |
| 17 | 23-Mar | Tuesday | Cutting Plane Methods | 4.2 |
| 18 | 25-Mar | Thursday | Midterm 2 | |
| 19 | 30-Mar | Tuesday | Branch and Bound Methods | 4.3 |
| 20 | 1-Apr | Thursday | Integer Programming Applications | |
| 21 | 6-Apr | Tuesday | The Transportation Problem | 5.1 |
| 22 | 8-Apr | Thursday | The Assignment Problem | 5.2 |
| 23 | 13-Apr | Tuesday | Graphs and Networks | 5.3 |
| 24 | 15-Apr | Thursday | The Maximal Flow Problem | 5.4 |
| 25 | 20-Apr | Tuesday | The Shortest Route Problem | 5.5 |
| 26 | 22-Apr | Thursday | The Critical Path Method | 5.6 |
| 27 | 27-Apr | Tuesday | Karmarkar's Algorithm | Appendix A |
| 28 | 29-Apr | Thursday | Review | |
| Final Exam | ||||