General Information | Syllabus | HW Assignments | Links |
Lectures | Sections in Text | Brief Description |
---|---|---|
Week 1 (3/28-3/30) | Ch 1-2 | Linear algebra, LP and the simplex method |
Week 2 (4/2-4/6) | Ch 2-3, 10 | The simplex algorithm, Geometry and the Fundamental Theorem of LP |
Week 3 (4/9-4/13) | Ch 5 | Duality, Dual simplex method |
Week 4 (4/16-4/20) | Ch 6-9 | Simplex method in matrix notation, parametric analyses and implementation issues |
4/17 | First Hour Exam | |
4/17 (x-hour) | In class part with take-home due tomorrow | |
Week 5 (4/23-4/27) | Ch 4, 13 | Complexity theory and the simplex method, network flows |
Week 6 (4/30-5/4) | Ch 13-14, 11 | Some combinatorics, applications of networks, matrix games and poker |
5/1 (x-hour) | Class will meet in x-hour to make up for the second exam | |
5/2 | Second Hour Exam | |
5/2 | In class part with take-home due tomorrow | |
Week 7 (5/7-5/11) | Ch 11, 16 | The Minimax Theorem, Interior point methods |
Week 8 (5/14-5/18) | Ch 16 | Interior point methods |
Week 9 (5/21-5/25) | Ch 22-23 | Integer and quadratic programming |
5/28 | No class: Memorial Day | |
Week 10 (5/30) | All | Review |
John Bourke
Last updated June 25, 2009 14:49:13 EDT