040974 UK Methods of Decision Support (2020S)
Continuous assessment of course work
Labels
Registration/Deregistration
Note: The time of your registration within the registration period has no effect on the allocation of places (no first come, first served).
- Registration is open from Mo 10.02.2020 09:00 to We 19.02.2020 12:00
- Deregistration possible until Th 30.04.2020 23:59
Details
max. 50 participants
Language: English
Lecturers
Classes (iCal) - next class is marked with N
- Thursday 05.03. 15:00 - 16:30 Seminarraum 3 Oskar-Morgenstern-Platz 1 1.Stock
- Thursday 19.03. 15:00 - 16:30 Seminarraum 3 Oskar-Morgenstern-Platz 1 1.Stock
- Thursday 26.03. 15:00 - 16:30 Seminarraum 3 Oskar-Morgenstern-Platz 1 1.Stock
- Thursday 02.04. 15:00 - 16:30 Seminarraum 3 Oskar-Morgenstern-Platz 1 1.Stock
- Thursday 23.04. 15:00 - 16:30 Seminarraum 3 Oskar-Morgenstern-Platz 1 1.Stock
- Thursday 30.04. 15:00 - 16:30 Seminarraum 3 Oskar-Morgenstern-Platz 1 1.Stock
- Thursday 07.05. 15:00 - 16:30 Seminarraum 3 Oskar-Morgenstern-Platz 1 1.Stock
- Thursday 14.05. 15:00 - 16:30 Seminarraum 3 Oskar-Morgenstern-Platz 1 1.Stock
- Thursday 28.05. 15:00 - 16:30 Seminarraum 3 Oskar-Morgenstern-Platz 1 1.Stock
- Thursday 04.06. 15:00 - 16:30 Seminarraum 3 Oskar-Morgenstern-Platz 1 1.Stock
- Thursday 18.06. 15:00 - 16:30 Seminarraum 3 Oskar-Morgenstern-Platz 1 1.Stock
- Thursday 25.06. 15:00 - 16:30 Seminarraum 3 Oskar-Morgenstern-Platz 1 1.Stock
Information
Aims, contents and method of the course
The aim of the course is to get acquainted with the basic concepts in the areas combinatorial optimization, dynamic optimization, and multicriteria decision analysis. Mathematical representations of important problem types (usually based on linear programming formulations) are introduced, and solution techniques are outlined. We shall discuss exact as well as heuristic solution methods. Among others, we will consider branch-and-bound methods, greedy algorithms, local search, simulated annealing, variable neighborhood search, genetic algorithms, dynamic programming, and epsilon-constraint methods.
Assessment and permitted materials
IMPORTANT: Due to the current coronavirus epidemics, no meetings in the course room will take place until April 3, 2020. During this time, the course is held via remote learning. For course material, additional support, discussion, and the way how to gain participation points during that time, please consult Moodle.Mode for the time after the resumption of physical meetings:
There is no compulsory attendance at the lectures. At the beginning of (most of) the lectures students can volunteer to present their solutions to exercises prepared at home. At the end of the term there may be an (optional) written exam in case the exercise presentations have not been sufficient or satisfactory.
There is no compulsory attendance at the lectures. At the beginning of (most of) the lectures students can volunteer to present their solutions to exercises prepared at home. At the end of the term there may be an (optional) written exam in case the exercise presentations have not been sufficient or satisfactory.
Minimum requirements and assessment criteria
Each student has to give at least three exercise presentations (in at least two different topics) in a satisfactory quality. For the way how to replace course-room presentations by the electronic submission of solved exercises during the "corona lockdown" phase, please consult Moodle.
Examination topics
All topics covered in the course.
Reading list
Necessary material (including a collection of exercises) will be made available to the participants by Moodle.
Association in the course directory
Last modified: Mo 07.09.2020 15:20