Operations Research Models – Operations Research Techniques – Art of Modeling – Construction of LP Model – Graphical LP solution – Graphical Sensitivity Analysis – The Simplex Algorithm – The M- method – The two phase method – degeneracy – Alternative optima – unbounded solutions – infeasible solution – redundancies – LP packages.
Changes affecting feasibility – Changes affecting optimality – Revised simplex method – LP packages.
Definition of Transportation model – The transportation algorithm – Determination of the starting solution – Iterative computations of the Algorithm – The Assignment Model – The Hungarian method – The Transshipment model – Inter programming problem – Cutting plane Algorithm.
Scope of Network Applications – Network solution – Minimal spanning tree Algorithm – Shortest Route problem – Examples – Shortest Route Algorithm – Maximal flow model – Minimum cost capacitated flow problems.
Network diagram representation – Critical path method – Time estimates – Crashing – Time charts – PERT and CPM for project scheduling – Resource planning – Case studies.
1. Ronald. L. Rardin, “Optimization in Operation Research”, Person Education, Asia, 2002.
2. JIT.S Chandran, Mahendran P. Kawatra Ki Ho Kim, “Essential of Linear Programming”, Vikas Publishing House Pvt.Ltd., New Delhi, 1994.
3. Hiller F.S Liberman G.J, “Introduction to Operation Research”, 6th Edition, McGraw Hill, 1995.
4. R.Panneer Selvam, “Operations Research”, Prentice Hall of India, 2002.
5. P.C. Tulsin, “Quantitative Technique : Theory and Problem”, Pearson Education, 2002.
6. Ravindran, Phillips, Solberg, “Operation Research Principles and Practice”, Second Edition, John wiley, 1987.