Wiki page, MVE166 / MMG631 Linear and integer optimization with applications: Problem solving sessions plan

Wiki page
2022-11-17T12:52:01+01:00

Each week there are two optional times for the problem solving sessions, of which you are typically assumed to visit one

Wednesdays 8–10 will be online (zoom) and Thursdays 10–12 will be on campus

For the Wednesday online session, you are expected to watch the videos covering the material beforehand and can come to ask questions regarding the theory/exercises

Zoom link: https://chalmers.zoom.us/j/69881351033

Password: opt2023

For the Thursday campus session, we will on the blackboard go through the same material as in the video (not necessary to watch the video beforehand)

The sessions will be given by either Gabrijela or Caroline (varies among weeks)

Numbers refer to the book Optimization Exercises

Please note that the numbering in videos and slides after session 5 are off by 1.

Session | Topics | Exercises recommended for students to solve | Exercises solved by teachers
1 | Mathematical modelling of linear optimization problems | 3.1 b, c, d; 3.5, 3.10, 3.12, 3.15 | 3.1 a, e, f; 3.4, 3.6, 3.14, example
2 | Linear optimization and the simplex method | 2.4, 2.6, 4.2, 4.6, 4.10, 4.11, 4.15 | 4.5, 4.13
3 | Duality theory and sensitivity analysis | 5.1, 5.5, 6.6, 6.8, 6.10, 6.15 | 5.4
4 | Integer linear optimization modelling | 13.4, 13.5, 13.6, 13.8, 13.12, 13.15 | 13.2, 13.9
5 | Integer linear optimization algorithms (branch-and-bound) | 15.3, 15.6, 15.10, 15.12, 15.14 | example, 15.13
6 | Cutting plane methods, minimal cover, Lagrangean duality | 14.4, 14.8, 17.9 (14.1, 14.3, 14.6, 14.9, 17.8) | 14.5, examples
7 | Network optimization: minimum spanning tree and shortest path algorithms | 8.10, 8.12, 8.17 a (8.18, 8.38 a, b) | examples