| studiehandbok@lith | |
|
|
|
|
|
| TAOP39 | Applied Combinatorial Optimization, 3,5 p (sw) /Optimering inom produktion och logistik/ Advancement level: D | |
| Aim: The course aims to give the students a deeper knowledge about combinatorial optimization, i.e. optimization problems with an underlying graph structure, and an insight in how mathematical theory can be used to formulate and solve practical problems, with emphasis on applications as distribution and transportation planning.Prerequisites: TAOP27 Operations research, extended course (I),TAOP29 Discrete Optimization (Y) or TAOP25 Operations Research.Course organization: The course is built up around a number of cases (practical applications), where the students work with problem analysis, modelling and solving. The lectures cover theory and optimization methodology. The cases are discussed and the students present the results of their work. Other practical applications are discussed. In the computer exercises optimization problems associated to the cases are solved by computer. In the seminars the students present scientific papers.Course content: Theory and optimization methodology. Different aspects on modelling of optimization problems (problem and algorithm complexity). Relaxations of combinatorial problems. The usage of duality in linear programming. Lagrangean duality and subgradient optimization. Branch-and-bound, column generation and cutting plane methods. Heuristic methods. Applications: Planning of transportation and distribution, facility location, scheduling and cost allocation. Course literature: Information about lecture notes (kompendium) is given at the beginning of the course. | ||
| |
|
|
 |
|||||
|
|
||||||
