|
Week - 1
|
Operational Research as a science field
Linear Programming(L/P) and examples of L/P models |
|
Week - 2
|
Different kinds of L/P problems and their equality; Basic consepts and qualities of solutions. |
|
Week - 3
|
Criteria of optimum; Simplex algorithm for L/P problem which can be designated one base solution |
|
Week - 4
|
Artificial base solution method. |
|
Week - 5
|
Problems of dual L/P; Relations of primal and dual; Primal-Dual computations. |
|
Week - 6
|
Problems of dual L/P; Relations of primal and dual; Primal-Dual computations.
(continiou). |
|
Week - 7
|
Dual Simplex method |
|
Week - 8
|
Economic interpratation of Duality. |
|
Week - 9
|
Transportation Models: Definition and Starting solution technics |
|
Week - 10
|
Transportation Models: Optimum solution technics |
|
Week - 11
|
The Assignment Model |
|
Week - 12
|
Network Models: Minimum spanning tree problems; Shortest path problems; |
|
Week - 13
|
Network Models: Maximum flow problems; PERT Analysis. |
|
Week - 14
|
Integer L/P: Cutting Planes algorithm; The Branch-and-Bound Method |