Introduction to Operations Research I
- type: Lecture
- chair: Nickel
- semester: Undergraduate, Bachelor-Foundation
-
place:
Building 30.46, Neue Chemie, room 001
-
time:
Thursday, 9:45-11:15
- start: April 24th, 2009
- lecturer:
- sws: 2
- lv-no.: 25040
- exam: Written examination
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.