4- Course Content :-
Topic |
No. of hours |
Lecture |
Tutorial/Practical |
Modeling; Introduction to Optimization Models Linear programming: Formulations and graphical solution.(Part I). |
5 |
3 |
2 |
Modeling; Introduction to Optimization Models Linear programming: Formulations and graphical solution. (Part II). |
5 |
3 |
2 |
Modeling; Introduction to Optimization Models Linear programming: Formulations and graphical solution. (Part III), |
5 |
3 |
2 |
Algebraic solution: the simplex method and dual-simplex method. Sensitivity analysis. Transportation and assignment problems(Part I). |
5 |
3 |
2 |
Algebraic solution: the simplex method and dual-simplex method. Sensitivity analysis. Transportation and assignment problems(Part II). |
5 |
3 |
2 |
Algebraic solution: the simplex method and dual-simplex method. Sensitivity analysis. Transportation and assignment problems(Part III). |
5 |
3 |
2 |
Network models: transportation, assignment, matching(Part I). |
5 |
3 |
2 |
Network models: transportation, assignment, matching(Part II). |
5 |
3 |
2 |
Integer programming: cutting-plane algorithms, branch and bound method. (Part I). |
5 |
3 |
2 |
Integer programming: cutting-plane algorithms, branch and bound method. (Part II). |
5 |
3 |
2 |
Dynamic programming: Examples of the dynamic programming. Models and computations, solution of linear programs by dynamic programs.(Part I). |
5 |
3 |
2 |
Dynamic programming: Examples of the dynamic programming. Models and computations, solution of linear programs by dynamic programs.(Part II). |
5 |
3 |
2 |
Project scheduling by PERT-CPM. Methods(Part I). |
5 |
3 |
2 |
Project scheduling by PERT-CPM. Methods(Part II). |
5 |
3 |
2 |