building E1.4 (MPI), room 308 

building E1.4 (MPI), room 308 
Linear optimization is a key subject in theoretical computer science. Many combinatorial problems, such as shortest paths, maximum flows, maximum matchings in graphs, among others have a natural formulation as a linear (integer) optimization problem. In this course you will learn:
· how to optimize a linear function subject to linear constraints
· how to formulate combinatorial problems as (integer) linear optimization problems
· how to solve them
Lecture 
Tuesday, 14:0016:00 
building E1.3, lecture theatre 003 
Lecture 
Thursday, 14:0016:00 
building E1.3, lecture theatre 003 
First lecture 
Tuesday April 15 

Final Exam (written) 
July 17th, 14:0017:00 
building E2.5, lecture theatre I 
Reexamination (oral) 
Sep 3rd & 9th 
TBA 
The lecture and the exercises will be held in English.
The credit for this course is 9 graded credit points (Leistungspunkte, LP). The credit is awarded upon successful participation at the final exam. The course grade equals the grade of the final exam. At least 50% of the credits in the exercises are necessary to be admitted to the final exam.