| Date | Text Section |
Topic | |
|---|---|---|---|
| Feb. | 6 | 1.1–1.5, 2.1–2.6 | Introductory Material |
| 8 | 3.1–3.3 | Two variable LPS, Formulation and Solution | |
| 10 | 3.4–3.12 | Applications of Linear Programming | |
| 13 | 3.4–3.12 | More Applications of Linear Programming | |
| 15 | 3.4–3.12 | Even More Applications of Linear Programming | |
| 17 | 4.1, 4.14 | Conversion of LPs to Standard Form | |
| 20 | 4.3, 4.4 | Theoretical Considerations | |
| 22 | 4.5 | The Simplex Algorithm | |
| 24 | 4.6–4.8 | Special Cases and Simplex (Mini Project Out) | |
| 27 | 4.9 | LINDO and lp_solve Software Packages | |
| 29 | 4.11, 4.12 | Degeneracy, Big M | |
| Mar. | 2 | 4.13 | Two-Phase Simplex |
| 5 | 6.2 | Important Simplex Tableau Formulas (Mini Project Due) | |
| 7 | 6.2 | Important Simplex Tableau Formulas, Continued | |
| 9 | 6.3 | Sensitivity Analysis | |
| 12 | 6.5, 6.6 | Mechanical Duality and Interpretation | |
| 14 | 6.7–6.8 | Duality Theory, Shadow Prices | |
| 16 | 6.9 | More Sensitivity Analysis | |
| 19 | SPRING BREAK!! | ||
| 21 | SPRING BREAK!! | ||
| 23 | SPRING BREAK!! | ||
| 26 | 6.10, 6.11 | Complementary Slackness and Dual Simplex | |
| 28 | 6.11 | Finish Dual Simplex, New Constraints | |
| 30 | In-class Exam | ||
| Apr. | 2 | 7.1–7.3 | The Transportation Problem |
| 4 | 7.1–7.3 | The Transportation Problem, Continued | |
| 6 | EASTER BREAK!! | ||
| 9 | EASTER BREAK!! | ||
| 11 | 7.5, 7.6 | Assignment and Transhipment Problems | |
| 13 | 8.1–8.3 | Shortest Path and Maximum Flow Problems | |
| 16 | 8.4 | Project Planning with CPM | |
| 18 | 8.6 | Minimum Spanning Tree | |
| 20 | 9.1, 9.2 | Integer Programs and Formulation | |
| 23 | 9.1, 9.2 | More Integer Programs and Formulation | |
| 25 | 9.3, 9.4 | Branch and Bound Solution of IPs (Project Out) | |
| 27 | 14.1, 14.2 | Constant Sum 2-Person Game Theory | |
| 30 | 14.2, 14.3 | LP Solution of Games | |
| May | 2 | 20.1–20.3 | Introduction to Queuing Theory, Distributions, Birth-Death |
| 4 | 20.4–20.6 | More Queuing Theory. | |
| 7 | Queuing Theory Applications (Project Due) | ||
| 9 | Catch-up, Review, Professor's Choice (Final Exam Out) | ||
| 11 | Catch-up, Review, Professor's Choice | ||
| 14 | Catch-up, Review, Professor's Choice | ||
| 19 | Final Exam (9:00am–11:00am) |