|     Subject Code:56051 L:3   T/P/D:1 Credits:3 Int. Marks:25 Ext. Marks:75 Total Marks:100  |   
|     UNIT I: I  |   
|     Introduction to   Operations Research: Basics definition, scope, objectives, phases, models and   limitations of Operations Research. Linear Programming Problem – Formulation   of LPP, Graphical solution of LPP. Simplex Method, Artificial variables,   big-M method, two-phase method, degeneracy and unbound solutions.  |   
|     UNIT II: II  |   
|     Transportation Problem.   Formulation, solution, unbalanced Transportation problem. Finding basic   feasible solutions – Northwest corner rule, least cost method and Vogel’s   approximation method. Optimality test: the stepping stone method and MODI   method.  |   
|     UNIT III: III  |   
|     Assignment model.   Formulation. Hungarian method for optimal solution. Solving unbalanced   problem. Traveling salesman problem and assignment problem.  |   
|     UNIT IV: IV  |   
|     Sequencing models.   Solution of Sequencing Problem – Processing n Jobs through 2 Machines –   Processing n Jobs through 3 Machines – Processing 2 Jobs through m machines –   Processing n Jobs through m Machines.  |   
|     UNIT V: V  |   
|     Dynamic programming.   Characteristics of dynamic programming. Dynamic programming approach for   Priority Management employment smoothening, capital budgeting, Stage   Coach/Shortest Path, cargo loading and Reliability problems.  |   
|     UNIT VI: VI  |   
|     Games Theory. Competitive   games, rectangular game, saddle point, minimax (maximin) method of optimal   strategies, value of the game. Solution of games with saddle points,   dominance principle. Rectangular games without saddle point – mixed strategy   for 2 X 2 games.  |   
|     UNIT VII: VII  |   
|     Replacement Models.   Replacement of Items that Deteriorate whose maintenance costs increase with   time without change in the money value. Replacement of items that fail   suddenly: individual replacement policy, group replacement policy.  |   
|     UNIT VIII: VIII  |   
|     Inventory models.   Inventory costs. Models with deterministic demand – model (a) demand rate   uniform and production rate infinite, model (b) demand rate non-uniform and   production rate infinite, model (c) demand rate uniform and production rate   finite.  |   
|     TEXT BOOKS:  |   
|     1. P. Sankara Iyer,   ”Operations Research”, Tata McGraw-Hill, 2008.  |   
|     2. A.M. Natarajan, P.   Balasubramani, A. Tamilarasi, “Operations Research”, Pearson Education, 2005.  |   
|     REFERENCE BOOKS:  |   
|     1. J K Sharma.,   “Operations Research Theory & Applications , 3e”, Macmillan India Ltd,   2007.  |   
|     2. P. K. Gupta and D. S.   Hira, “Operations Research”, S. Chand & co., 2007.  |   
|     3. J K Sharma.,   “Operations Research, Problems and Solutions, 3e”, Macmillan India Ltd.  |   
|     4. N.V.S. Raju,   “Operations Research”, HI-TECH, 2002.  |