| Week | Lectures/Assignments | Reading Assignment | Notes, Handouts | |
| 1 | 09/09/2009 | Introduction to Operations Research. Example Production Planning Model. Background Survey(Complete Survey by 09-16) |
Chapter 1, Articles in the Supplementary section. | 01-OR Hsitory |
| 2 | 09/14/2009 | Inventory, Inventory EOQ Model. Model Classification. | Sec 1.2, 2.3, 1.4, 1.5. | 02 - Inventory Examples 1 and 2 |
| 2 | 09/16/2009 | Graphical Plot, Graphical Solution, Large LPs and use of Indexes. Problem to think over the weeekend: Multi-Period Production Planning. | Sec 2.2, 2.3. | Examples 3 and 4 |
| 3 | 09/21/2009 | Linear Programming: Allocation, Blending Models, Operations Planning Models HW 1 |
Reading: Ch 4.1, 4.2, 4.3. HW 1 : Due 09/28/2009 |
Examples 5 and 6 |
| 3 | 09/23/2009 | Shift Scheduling, Time Phased Models, Models with Linearizable Nonlinear Objectives. |
Reading: Ch 4.3, 4.4, 4.5,4.6. HW 1 : Due 09/28/2009 |
Examples 7 and 8 |
| 4 | 09/28/2009 | Improvement Search, Unimodal Functions HW1 is Due. HW 2: Due 10/05/2009. |
Reading: Ch 3.1, 3.2, 3.3, 3.4. |
|
| 4 | 09/30/2009 | Improvement Search Algorithm | Reading: Ch 3.4, 5.1, 5.2, 5.3, 5.4. HW 2 : Due 10/05/2009 |
|
| 5 | 10/05/2009 | Unimodal Functions, Extreme Points and Standard form LP HW 3: Due 10/12/2009. |
Reading: Ch 3.4, 5.1, 5.2 HW 3 : Due 10/12/2009 |
|
| 5 | 10/07/2009 | Standard Form LP and Simplex Method HW 3: Due 10/12/2009. |
Reading: Ch 3.4, 5.1, 5.2, 5.3 HW 3 : Due 10/12/2009 |
Linear Programs : Extreme Points and Standard Form || Linear Programs : Rudimentary Simplex Method |
| 6 | 10/12/2009 | Simplex Method. Two Phase Approach and Revised Simplex. HW 3 Due in class. HW4 will be posted 10-19-2009. |
Reading: Ch 5.4, 5.5, 5.8 | |
| 6 | 10/14/2009 | Mid Term I | Topics and Practice Problems from Chapter 5: See Announcements Section | |
| 7 | 10/19/2009 | Revised Simplex Method HW 4: 5.23, 5.25, 5.27. Due Oct 26, 2009. |
Reading: Ch 5.4, 5.8 | Simplex Dictionary Form, Revised Simplex : Components |
| 7 | 10/21/2009 | Revised Simplex Method HW 4: 5.23, 5.25, 5.27. Due Oct 26, 2009. |
Reading: Ch 5.8, 7.1 | Revised Simplex : Applied (Open Office Presentation and its pdf version ) |
| 8 | 10/26/2009 | Variations in Optimal Values Construction of Dual Problem. HW 5: Problems 7.5(b,d), 7.6(b), 7.7(b), 7.9, 7.12(b,f), 7.13(b,f), 7.14(b), 7.16(b,d). Due Nov 02, 2009. |
Reading: Ch 7.1, 7.2, 7.3 | Changes to Optimal Value
(Open Office Presentation and its pdf version ) Revised Simplex, Construction of Dual and its properties (Open Office Presentation and its pdf version ) |
| 8 | 10/28/2009 | Construction of Dual and Description of Optimality | Reading: Ch 7.4, 7.5 | Dual Construction (as Open Office Presentation and its pdf version ) |
| 9 | 11/02/2009 | Use of Duals to explain existence of Nash Equilibrium in Zero Sum Games. | ||
| 9 | 11/04/2009 | Graphs and Paths. Shortest Path Problem. Bellman-Ford Algorithm. | Reading: Ch 9.1, 9.2, 9.3 (excluding discussion of negative dicycles) | |
| 10 | 11/09/2009 | Floyd Warshall Algorithm and Dijkstras Algorithm HW 6: Problems 7.17(b), 7.18(b), 7.23, 7.24, 9.6, 9.10, 9.13, 9.16. Due Nov 18, 2009. |
Reading: Ch 9.3, 9.4, 9.5 | |
| 10 | 11/11/2009 | Dijkstras algorithm, Negative Dicycles. Introduction to Optimization Software. Meeting Place: ME 314 | Reading: Ch 9.5, 7.6 | |
| 11 | 11/16/2009 | Mid Term II Project: Due 12/16/2009. |
Topics: Ch 5.4, 5.8, 7.1, 7.2, 7.3, 7.4, 7.5, 9.1, 9.2, 9.3, 9.4, 9.5 Not Included: Negative Dicycles, Computer Outputs, Game Theory. |