de | en

Discrete Optimization

Module MA3502

This Module is offered by TUM Department of Mathematics.

This module handbook serves to describe contents, learning outcome, methods and examination type as well as linking to current dates for courses and module examination in the respective sections.

Module version of SS 2012 (current)

There are historic module descriptions of this module. A module description is valid until replaced by a newer one.

available module versions
SS 2012WS 2011/2

Basic Information

MA3502 is a semester module in English language at Master’s level which is offered in winter semester.

This Module is included in the following catalogues within the study programs in physics.

  • Catalogue of non-physics elective courses
Total workloadContact hoursCredits (ECTS)
150 h 45 h 5 CP

Content, Learning Outcome and Preconditions

Content

Complexity, Polyhedral methods, (e.g. Total unimodularity, Cutting planes, Branch-and-bound), Approximation.

Learning Outcome

After successful completion of the module the students are able to understand the underlying structure of tractable and hard problems which allows them to apply advanced methods in optimization. In particular, they will be able to detect relevant structures (e.g. total unimodularity), and derive there properties. Also they will be able to to derive and apply advanced methods (e.g. cutting planes) and apply them to specific examples.

Preconditions

MA1001 Analysis 1, MA1002 Analysis 2, MA1101 Linear Algebra and Discrete Structures 1, MA1102 Linear Algebra and Discrete Structures 2, MA2501 Algorithmic Discrete Mathematics, MA2504 Linear and Convex Optimization
Für Studierende für Lehramt an Gymnasien: MA9935 Einführung in die Mathematik 1 LG, MA9936 Einführung in die Mathematik 2 LG, MA9937 Analysis 1 LG, MA9938 Analysis 2 LG, MA9939 Lineare Algebra 1 LG, MA9940 Lineare Algebra 2 LG, MA2501 Algorithmic Discrete Mathematics, MA3501 Linear Optimization (or MA2504 Fundamentals of Convex Optimization)

Courses, Learning and Teaching Methods and Literature

Courses and Schedule

Learning and Teaching Methods

lecture, exercise course, self-study assignments
The module is offered as lectures with accompanying practice sessions. In the lectures, the contents will be presented in a talk with demonstrative examples, as well as through discussion with the students. The lectures should motivate the students to carry out their own analysis of the themes presented and to independently study the relevant literature. Corresponding to each lecture, practice sessions will be offered, in which exercise sheets and solutions will be available. In this way, students can deepen their understanding of the methods and concepts taught in the lectures and independently check their progress.

Media

blackboard

Literature

Cook, Cunningham, Pulleyblank, Schrijver: Combinatorial Optimization, Wiley Interscience, 1998.
Papadimitriou, Steiglitz: Combinatorial Optimization, Dover 2001.

Module Exam

Description of exams and course work

The module examination is based on a written exam (60 minutes). Students will have to analyze different discrete optimization problems. They should be able to use techniques and concepts presented in the lecture and should show an understanding of standard algorithms to solve integer linear optimization problems.
Problems considered in the exercises will also be relevant.

Exam Repetition

The exam may be repeated at the end of the semester.

Top of page