Week - 1 |
Operations Research Methodology,
Basic concepts of Linear Programming
|
Week - 2 |
Formulating linear decision model, Graphical Solution, Solution techniques in LP, Assumptions of LP |
Week - 3 |
Modeling examples with LP |
Week - 4 |
Solving LP models with softwares (Excel and GAMS) |
Week - 5 |
Introdcution to Simplex Algorithm, Linear Indepencendcy, Basic Solution, Relationship between Basic Feasible Solution and Extreme Point, The algebra of the Simplex Method. |
Week - 6 |
The Simplex Method in tabular form |
Week - 7 |
Big M Method, Two-phased Simplex Algoritm |
Week - 8 |
Transportation problems and modelling techniques. Introduction to transportation Simplex. Finding basic feasible solution. |
Week - 9 |
Transportation Simplex Algorithm. Optimization test and finding entering and leaving variables. |
Week - 10 |
Assignment Problem. Hungarian Algorithm. |
Week - 11 |
GAMS applications for Transportation and Assignment Problems. |
Week - 12 |
Network Models’ terminology. Network optimization models. Shortest path problem and Dijikstra’ Algorithm. |
Week - 13 |
Minimum spanning tree problem. Maximum flow problem. |
Week - 14 |
Introduction to integer programming and sample models. |