Decision making methods (BMEKOKGM110)

 

Course Material:

Book  (Only available from the University of the Network)

Lecture 1 – Simplex Method (Example)

Lecture 2 – Two Phase Simplex Method and Duality Theory

Lecture 3 – Transportation Problem (Example)

Lecture 4 – Hungarian Method and Assignment Problem (Example)

Lecture 5 – Network Optimization (Example)

Lecture 6 – Maximum Flow Minimum Cost Problem

Lecture 7 – Integer Programming Problems

Lecture 8 – Traveling Salesman Problem

Lecture 9 – Game Theory

Lecture 10 – Forecasting

Lecture 11 – Queuing Theory