Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 1

B. Tech.

ME VII SEMESTER

OPERATIONS RESEARCH
(Common to ME, CSE, IT & ECE) Course Code: AME11T20 LTPC 4 - - 4

SYLLABUS
UNIT I INTRODUCTION TO OPERATIONS RESEARCH: Basics definition, scope, objectives, phases, models and limitations of Operations Research. Linear Programming Problem, Formulation and Graphical solution of Linear Programming Problem. Simplex Method, Artificial variables Techniques, big -M method, two -phase simplex method, degeneracy and unbound solutions.

UNIT II TRANSPORTATION PROBLEM: Formulation, solution, unbalanced Transportation problem. Finding basic feasible solutions, North-West corner rule, least cost method and Vogels approximation method. Optimality test MODI method. ASSIGNMENT MODEL: Formulation, Hungarian method for optimal solution, solving unbalanced problem, Traveling salesman problem as assignment problem. UNIT III SEQUENCING MODELS: Solution of Sequencing Problem, Processing n Jobs through two machines, Processing n Jobs through three machines, Processing two Jobs through m machines, Processing n Jobs through m Machines. QUEUING THEORY: Introduction, Single Channel, Poisson arrivals, exponential service times with infinite population and finite population models. UNIT IV 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. INVENTORY MODELS: Inventory costs, Models with deterministic demand model: (a) Demand rate uniform and production rate infinite, (b) Demand rate non-uniform and production rate infinite, (c) Demand rate uniform and production rate finite. UNIT V GAME THEORY: Competitive game, 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. 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. TEXT BOOKS: 1. A. M. Natarajan, P. Balasubramani, A. Tamilarasi (2006), Operations Research, Pearson Education, India. 2. S. D. Shama (2009), Operation Research, Tata McGraw Hill, New Delhi. REFERENCE BOOKS: 1. J. K. Sharma (2007), Operations Research Theory and Applications, 3rd edition, Macmillan India Ltd, India. 2. R. Panneerselvam (2008), Operations Research, 2nd edition, Prentice Hall of India, India. 3. F. S. Hillier, G. J. Lieberman (2007), Introduction to Operations Research, 8th edition, Tata McGraw Hill, New Delhi, India.

You might also like