| Date | Teacher | Place | Topic | Lecture notes / comments |
| 01.01.2010 | LECTURE | EXERCISES | ||
| 25.01.2010 | GD | B1036 NH Abels hus | Introduction. Examples. Simplex algorithm. Basic principles. V 1, V2 (=Vanderbei, Kap.1), V12 | |
| 27.01.2010 | GD | B1036 NH Abels hus | Simplex algorithm. Initialization, unbounded solution. V 2 | |
| 01.02.2010 | GD | B1036 NH Abels hus | Degenerate problems. Cycling/anti-cycling rules. V3. The fundamental theorem of LP. | 1.2, 1.3 (from Vanderbei), 2.2, 2.3, 2.4, 2.9, 2.10. OPL-CPLEX introduction. |
| 08.02.2010 | GD | B1036 NH Abels hus | Equivalent optimization problems. Efficiency of simplex alg. V 4. | 2.12, 2.16, 2.18, 2.19, 3.1, 3.2, 3.3, 3.4 |
| 15.02.2010 | GD | B1036 NH Abels hus | Duality theory 1. V 5. | 4.1, 4.2, 4.4, 4.6, 4.7 |
| 22.02.2010 | NO LECTURE (but class on Wednesday) | 5.1, 5.4, 5.5, 5.7 | ||
| 01.03.2010 | GD | B1036 NH Abels hus | Duality theory 2. V 5. | 5.6, 5.8, 5.10, 5.15, 5.16 |
| 08.03.2010 | GD | B1036 NH Abels hus | Matrix version of the simplex alg. V 6. | 6.1, 6.3, 6.6 |
| 15.03.2010 | Interior point methods | 17.1, 17.2, 17.3, 17.4 | ||
| 22.03.2010 | GD | B1036 NH Abels hus | Sensitivity analysis (V 7.1). Game theory (V 11.1-11.3). | 7.1, 11.2, 11.3, 11.5, 11.6, OPL-CPLEX nr. 3 |
| 29.03.2010 | Påskeferie | |||
| 07.04.2010 | Forelesning på onsdag (gruppetiden) GD | B1036 NH Abels hus | Linear inequalities, Fourier-Motzkin elimination. From "A mini-intro. to convexity" (on web page) | 18.1 |
| 12.04.2010 | GD | B1036 NH Abels hus | Convexity. See "A mini-intro. to convexity" | 7.2. From "A mini-intro. to convexity": exer. 1, 2, 3, 4, 5, 6, 7, 8, 9. |
| 19.04.2010 | GD | B1036 NH Abels hus | Convexity. See "A mini-intro. to convexity" | From "A mini-intro. to convexity": exer. 10, 11, 12, 13, 14, 15, 16, 17. |
| 26.04.2010 | GD | B1036 NH Abels hus | Network flows. Network simplex alg. V 14 (in 2.ed. this is chapter 13) | From "A mini-intro. to convexity": exer. 18, 19, 20, 21, 22, 23, 24. |
| 03.05.2010 | GD | B1036 NH Abels hus | Network simplex alg. V 14. | 14.1, 14.2, 14.4 (in second ed., similar exercises from chapt. 13) |
| 10.05.2010 | GD | B1036 | Shortest paths, dynamic programming | 14.3, 14.11, 14.12, 14.14 |
| 19.05.2010 | (Mandag er 17.mai, så forelesning istedet på onsdag, gruppetiden) GD | B1036 NH Abels hus | Summary/questions, solution Exam 2008 presented | Exam 2008: solution presented. In the remaining time you may work on other exam problems and ask Solveig. |
| 26.05.2010 | Open group/questions. |
Teaching plan
Published Dec. 15, 2009 2:11 PM
- Last modified May 6, 2010 10:43 AM