|
Week - 1 |
The transportation Problem and Modeling techniques. |
|
Week - 2 |
Introduction to The Transportation Simplex Method |
|
Week - 3 |
Finding an initial basic feasible solution. Writing GAMS codes for solving transportation problems and LP models. |
|
Week - 4 |
The Transportation Simplex Method. The optimality test and finding of an entering and leaving basic variables. |
|
Week - 5 |
Network Optimization Models. The Shortest-Path Problem. |
|
Week - 6 |
Maximum flow problem |
|
Week - 7 |
The Minimum Cost Flow Problem. |
|
Week - 8 |
LP models for Network optimization problems and GAMS codes. |
|
Week - 9 |
Integer Programming. Prototype example. |
|
Week - 10 |
The Branch-and-Bound Technique. |
|
Week - 11 |
A Branch-and-Bound Algorithm for Mixed Integer Programming. |
|
Week - 12 |
The branch and cut approach to solving binary integer programming problems. |
|
Week - 13 |
GAMS application |
Eskisehir Technical University Info Package 
Turkish 
English