Introduction to Operations Research I

  • type: Lecture
  • chair: Nickel
  • semester: Bachelor (Core program)
  • place:

    Lecture hall A/B (Audimax), Bdg. 30.95
  • time: Tuesday, 09:45-11:15 
  • start: 17.04.2012
  • lecturer: Prof. Dr. Stefan Nickel
  • sws: 2
  • lv-no.: 2550040
  • exam: Written exam on Introduction to OR I and II at the end of winter term 2012/13

Contents

Examples for typical OR problems.

Linear Programming: Basic notions, simplex method, duality, special versions of the simplex method (dual simplex method, three phase method), sensitivity analysis,parametric optimization, game theory.

Graphs and Networks: Basic notions of graph theory, shortest paths in networks, project scheduling, maximal and minimal cost flows in networks.

Structure:

  • Linear optimization
  • Graph theory
  • Project scheduling

Literature

  • Nickel, Stein, Waldmann: Operations Research, Springer
  • Hillier, Lieberman: Introduction to Operations Research, McGraw-Hill
  • Murty: Operations Research, Prentice-Hall
  • Neumann, Morlock: Operations Research, Hanser
  • Winston: Operations Research - Applications and Algorithms, PWS-Kent
  • Büning, Naeve, Trenkler, Waldmann: Mathematik für Ökonomen im Hauptstudium, Oldenbourg