TAOP61 Optimization of Realistic Complex Systems
Teaching plan 2015
Lect 1-2: Introduction, formulation of structured models.
Decomposition as idea.
Column generation.
Introduction to project 1.
Book: Chapt 2.3, 3.3, (4.1), 12.1, (14.5). Komp: Chapt 1.
Exerc 1: Model formulation.
Tasks: 2.4, 3.4, 3.6, 3.8, 2.5, 4.4, 2.3, 3.7.
La 1-3: Project 1.
Lect 3: Dynamic programming.
Introduction to project 2.
Book: Chapt 11.3.
Exerc 2: Dynamic programming.
Tasks: 11.11, 13.7b, 11.10, 13.9b, 13.17b.
La 4-6: Project 2.
Lect 4-7: Lagrange duality.
Decomposition methods.
Introduction to project 3.
Presentation of project 1.
Book: Chapt 16.6, 17. Komp: Chapt 2, 3, 4, 5.
Exerc 3: Decomposition methods.
Tasks: D3, D5, D12, D13, D14, D16, D18, D28, D9, D10.
La 7-9: Project 3.
Lect 8: Postman problems.
Heuristics. Relevant neighborhoods for local search.
Routing.
Introduction to project 4.
Presentation of project 2.
Book: Chapt 10.6, 16.4, 16.5.
Exerc 4:
Postman problems. Tasks: 10.18c, 10.14, 10.13.
Heuristics. Tasks: 16.5, 16.6, 16.9, 16.8.
La 10-12: Project 4.
Lect 9-10: Presentation of project 3 and 4. Discussion about project 4.
Sidansvarig: nils-hassan.quttineh@liu.se
Senast uppdaterad: 2019-11-29