The material to be covered in this course consists of about one-half application
("How do you work it?") and one-half theory ("How does it work?") We will proceed with the two parts in parallel, covering some of each most days. Following is a 25 lesson schedule for the quarter. There are 29 class meetings so this gives us a little time for testing and for catch-up, but not much. It will be clear from class where we are in this list; if you miss you must check with me or another student to find out where we are.
Tentative Course SchedulePlease Note: This schedule is subject to change as the course progresses. | ||
| Lesson | Application Section(s) | Theory Sections(s) |
| 1 | 1.1 - Overview 1.2 - Examples |
2.1 - Matrices and Vectors |
| 2 | 1.3 - Where to Read More 1.4 - About the Book |
2.2 - Matrices and Sysems of Equations |
| 3 | 3.1 - What is Linear Programming? | 2.3 - Gauss-Jordan Reduction |
| 4 | 3.2 - Graphic Solution to a 2D Problem | 2.5 - Inverse of a Matrix |
| 5 | 3.3 - Special Cases | 2.6 - Determinants |
| 6 | 3.4 - Diet Problem | 4.1 - Standard Form |
| 7 | 3.5 - Work Schedule Problem | 4.2 - Preview of Simplex Algorithm |
| 8 | 4.3 - Simplex Algorithm | |
| 9 | 4.4 - Minimum Problems | |
| 10 | 3.6 - Capital Budgeting | 4.5 - Alternate Optimal Solutions |
| 11 | 3.8 - Blending Problem | 4.6 - Unbounded LP Problems |
| 12 | 3.9 - Production Models | 4.9 - Degeneracy Considerations |
|
Math 370 Schedule (Continued) | ||
| Day | Application Section(s) | Theory Sections(s) |
| 13 | 3.10 - Inventory | 4.10 - Big M Method |
| 14 | 6.1 - Introduction to Sensitivity | |
| 15 | 6.2 - Important Formulas | |
| 16 | 6.3 - Sensitivity | |
| 17 | 7.1 - Transportation Problem LP Solution to Transportation |
6.8 - Shadow (Dual) Prices |
| 18 | 7.5 - Assignment Problem | 6.5 - Dual of an LP Problem |
| 19 | 7.6 - Transshipment Problem | 6.6 - Interpretation of Dual Problem |
| 20 | 6.7 - Dual Theorem | |
| 21 | 8.3 - Max Flow Problem | 8.1 - Networks |
| 22 | (Handouts) CPM and PERT | 8.2 - Shortest Path Algorithm |
| 23 | 8.6 - Minimum Spanning Tree | |
| 24 | 9.1 - Integer Programming | 9.3 - Branch and Bound Method |
| 25 | 9.2 - Integer Formulation | 9.4 - Mixed Branch and Bound |
| Final exam: Take Home | ||