Optimization

Core Course, 4+2

Basic Information

Lecturer:Andreas Karrenbauer
Lectures:Tuesday + Thursday, 14:00 - 16:00, E1.3 HS001; first lecture on Apr 10
Teaching Assistant:Maximilian John
Tutors:

Ahmed Abbas, Sören Bund-Becker

Tutorials:

Monday, 10-12, room 024, E1 4 (except on May, 7 and May, 22: room 021, E1 4)

Friday, 12-14, room 024, E1 4

The first tutorial session will be held at 27th of April.

The tutorial on Pentecost Monday (21st of May) is going to be moved to Tuesday (22nd of May) to room 021 in E1 4.

Credits:9
Prerequisites:Basics in linear algebra, discrete mathematics, calculus, algorithms, and complexity. At Saarland University these topics are covered in the bachelor courses Mathematik für Informatiker 1 & 2, Grundzüge der Theoretischen Informatik, and Grundzüge von Algorithmen und Datenstrukturen.
Exam:

Your final grade will be the best of the final exam and the re-exam. You may bring one A4 cheat sheet (double-sided, in your own handwriting) to the exams. Exams might be oral if there is only a small number of registered participants.

Final Exam: July 24th, 13:30 - 16:30

Re-Exam: TBA

 

If you want to participate in the course, please register to our mailing list!

The tutorial assignment is finished and can be found here.

Description

This course provides an introduction to fundamental concepts and algorithmic methods for solving linear and integer linear programs. 

Linear optimization is a key subject in theoretical computer science. Moreover, it has many applications in practice. A lot of problems can be formulated as (integer) linear optimization problem. For example, 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

To this end, basic concepts from polyhedral theory will be introduced. The simplex algorithm and the ellipsoid method will be presented. The lecture concludes with exact and approximation algorithms for NP-hard optimization problems. There will be theoretical and practical exercises.

               

Policies

This is a 9-credit-point core lecture ("Stammvorlesung"). There will be two lectures and one exercise session per week. We will hand out exercises every week (usually worth 40 points) and each student should score at least 50% in the first half of the course (first 6 exercise sheets) and 50% in the second half in order to be allowed to take the exam.

Lectures

The slides of all lectures condensed in a handout can be found here.

DateTopicReferenceHomeworkNotes
Apr 10Overview Sheet 0, Solution 0Slides
Apr 12Polyhedra and Integer OptimizationChapter 6 in [W]; Chapter 11.8 in [BT] Slides
Apr 17Integer Optimization and ApplicationsChapter 7 in [W]; Chapter 11.2 in [BT]Sheet 1Slides
Apr 19Branch and Bound, DualityChapter 4.7, 11.2 in [BT] Slides

Literature

Good textbook on the topic include: