Informationsansvarig: Oleg Burdakov, olbur@mai.liu.se
MAI > %7Eolbur > kurser > TAOP23 > plan

Andra sökmöjligheter

|
MAI > olbur > kurser > TAOP23 > plan

## TAOP23 Optimization, Teaching plan

To successfully follow the course, some extra efforts are required from the students on reading the book and solving problems beyond the scheduled class hours. Below one can find which book chapters to read and problems to solve for each lecture. During the tutorial sessions, one can learn how to solve some of these problems. The rest are supposed to be solved by the students themselves, either during the tutorial sessions, or at home. There are much more problems in the book that can help to understand better the course topics. The exam  assignments (available for downloading from the course web page) are strongly recommended  as good exercises.

Lecture 1: Introduction to optimization. Modeling. Graphical solution. Ch. 1, 2.1-3 and 3.
Problems: 1.3,  2.1-3, 2.6, 3.1-5.

Lecture 2: Linear programming. The simplex method. Ch. 4.1-7 and 4.10..
Problems: 4.1-7.

Lecture 3: Sensitivity analysis. LP-dual. Ch. 5.1-5.
Problems: 5.1-5.6a), 5.7-8, 6.1-2.

Lecture 4: LP-dual (cont). Ch. 6.
Problems: 6.4-14.

Lecture 5: Introduction to nonlinear optimization. Convex functions. Ch. 2.4-5 and 9.
Problems: 2.4-5, 9.4-9.

Lecture 6: Unconstrained optimization. Ch. 10.1-3.
Problems: 9.10, 10.2-4, 10.5b-8, 10.10-13.

Lecture 7: Constrained optimization. Ch. 11. and 12.3.
Problems:  11.1-10, 12.14.

Lecture 8: Integer programming. Branch-and-bound. Cutting planes. Ch. 13.1-3,  14.1-3, 14.5-14.5.1, 15.1-3 and 15.4.1.
Problems: 14.1, 14.4-6, 15.1-4, 15.6-7, 15.10-14.

Lecture 9: Shortest path. Minimal spanning tree. Ch. 8.1-4.
Problems:  8.1, 8.12-13, 8.15, 8.17-19.

Lecture 10: Flow in networks. Maximal flow. Min-cost flow. Ch. 7.1, 8.6.2-3, 8.7, lecture notes
Problems: 8.27-36.
Exams:  071019 A3,5; 080112 A6; 081018 A5,6; 090114 A5,6; 090821 A5,6; 091020 A6;  100825 A5,6., 101022 A5,6, 110826 A6, 111020 A5,6,
120114 A5,6, 120823 A5,6.

Lecture 11: Dynamic programming. Ch. 18.
Problems: 18.1-11.