Programming-formulation, solution by graphical and simplex methods (Primal - Penalty, Two
Phase), Special cases. Dual simplex method. Principles of Duality. Sensitivity Analysis.
UNIT II LINEAR PROGRAMMING EXTENSIONS
Problems – Initial Basic feasible solution by N-W Corner Rule, Least cost and Vogel’s
approximation methods. Check for optimality. Solution by MODI / Stepping Stone method. Case of Degeneracy. Transhipment Models. Assignment Models (Minimising and Maximising Problems) – Balanced and Unbalanced Problems. Solution by Hungarian and Branch and Bound Algorithms. Travelling Salesman problem. Crew Assignment Models.
UNIT III INTEGER PROGRAMMING AND GAME THEORY
UNIT IV INVENTORY MODELS, SIMULATION AND DECISION THEORY
Models. Decision making under risk – Decision trees – Decision making under uncertainty.
UNIT V QUEUING THEORY AND REPLACEMENT MODELS
calling source. Replacement Models-Individuals replacement Models (With and without time value of money) – Group Replacement Models.