Diese Seite auf DE

Event

Introduction to Operations Research II [WS212530043]

Type
lecture (V)
Präsenz/Online gemischt
Term
WS 21/22
SWS
2
Language
Deutsch
Appointments
15
Links
ILIAS

Lecturers

Organisation

  • Kontinuierliche Optimierung

Part of

Literature

  • Nickel, Stein, Waldmann: Operations Research, 2. Auflage, Springer, 2014
  • Hillier, Lieberman: Introduction to Operations Research, 8th edition. McGraw-Hill, 2005
  • Murty: Operations Research. Prentice-Hall, 1995
  • Neumann, Morlock: Operations Research, 2. Auflage. Hanser, 2006
  • Winston: Operations Research - Applications and Algorithms, 4th edition. PWS-Kent, 2004

Appointments

  • 21.10.2021 10:00 - 11:30 - Room: 11.40 Johann-Gottfried-Tulla-Hörsaal
  • 28.10.2021 10:00 - 11:30 - Room: 11.40 Johann-Gottfried-Tulla-Hörsaal
  • 04.11.2021 10:00 - 11:30 - Room: 11.40 Johann-Gottfried-Tulla-Hörsaal
  • 11.11.2021 10:00 - 11:30 - Room: 11.40 Johann-Gottfried-Tulla-Hörsaal
  • 18.11.2021 10:00 - 11:30 - Room: 11.40 Johann-Gottfried-Tulla-Hörsaal
  • 25.11.2021 10:00 - 11:30 - Room: 11.40 Johann-Gottfried-Tulla-Hörsaal
  • 02.12.2021 10:00 - 11:30 - Room: 11.40 Johann-Gottfried-Tulla-Hörsaal
  • 09.12.2021 10:00 - 11:30 - Room: 11.40 Johann-Gottfried-Tulla-Hörsaal
  • 16.12.2021 10:00 - 11:30 - Room: 11.40 Johann-Gottfried-Tulla-Hörsaal
  • 23.12.2021 10:00 - 11:30 - Room: 11.40 Johann-Gottfried-Tulla-Hörsaal
  • 13.01.2022 10:00 - 11:30 - Room: 11.40 Johann-Gottfried-Tulla-Hörsaal
  • 20.01.2022 10:00 - 11:30 - Room: 11.40 Johann-Gottfried-Tulla-Hörsaal
  • 27.01.2022 10:00 - 11:30 - Room: 11.40 Johann-Gottfried-Tulla-Hörsaal
  • 03.02.2022 10:00 - 11:30 - Room: 11.40 Johann-Gottfried-Tulla-Hörsaal
  • 10.02.2022 10:00 - 11:30 - Room: 11.40 Johann-Gottfried-Tulla-Hörsaal

Note

Integer and Combinatorial Programming: Basic notions, cutting plane metehods, branch and bound methods, branch and cut methods, heuristics.

Nonlinear Programming: Basic notions, optimality conditions, solution methods for convex and nonconvex optimization problems.

Dynamic and stochastic models and methods: dynamical programming, Bellman method, lot sizing models, dyanical and stochastic inventory models, queuing theory.

Learning objectives:

The student

  • names and describes basic notions of integer and combinatorial optimization, nonlinear programming, and dynamic programming,
  • knows the indispensable methods and models for quantitative analysis,
  • models and classifies optimization problems and chooses the appropriate solution methods to solve optimization problems independently,
  • validates, illustrates and interprets the obtained solutions.