TAOP25	Operations Research, ECTS-points /TILLÄMPAD OPTIMERINGSLÄRA/ Advancement level: C
	Aim: The course constitutes a continuation course in optimization and treats mainly optimization problems in discrete variables. The course is intended to give the students (i) an exemplified orientation of important classes of optimization problems (ii) experience in analysis and formulation of realistic optimization problems from technical and economical applications with the help of mathematical models (iii) knowledge of construction of efficient methods for solution of the resulting mathematical problems using computer software (iv) experience in solving optimization problems with discrete variables Prerequisites: TAOP10 Linear and Nonlinear Optimization M. Course organization: The lectures provide the necessary mathematical theory for the algorithm development. The exercises cover modeling and problem solving. The laboratory assignment consists of solving optimization problems with the help of computer. Course content: Network optimization: Problem types: Graph theory, minimal spanning tree, shortest path, network flow, integer problems with graph structure, transportation problem. Dynamic programming: Problem areas, controlled recursive processes, the principle of optimality, problem formulation, applications. Course literature: Holmberg, K.: Flöden i nätverk och kombinatorisk optimering, LiTH 1993. Holmberg, K.: Heltalsprogrammering och dynamisk programmering, LiTH 1993.
LAB1	Labratory work
TEN1	Written examination

Course language is Swedish.