What is Operations Research,
Modelling with Linear Programming: Formulation of Model, Graphical solution;
Simplex Method with Sensitivity Analysis: Artificial Starting solution, R- Method, M-Method; Special Cases in Simplex Method :Degeneracy, Alternative Optima, Unbounded solution; Sensitivity Analysis, Duality and post optimal Analysis :Economic Interpretation and additional simplex algorithms; Transportation and Assignment Problem: Transportation model, assignment algorithm; Hungarian Method to solve Assignment problem, Network Models: Shortest route problem, Maximal flow problems. CPM/Pert for critical path finding. Dijiktra’s Floryd’s Algorithm to find shortest route, Critical Path Problem, Goal Programming: Formulation, Algorithms; Programming with Excel.