Operation Research Syllabus

Course Code: MB0048

Course Title: Operation Research (4 Credits)




Course Contents


Unit 1- Introduction to Operations Research:            Introduction, Historical Background, Scope of Operations Research , Features of Operations Research, Phases of Operations Research, Types of Operations Research Models, Operations Research Methodology, Operations Research Techniques and Tools , Structure of the Mathematical Model, Limitations of Operations Research


Unit 2- Linear Programming: Introduction, Linear Programming Problem, Requirements of LPP, Mathematical Formulation of LPP,    Case Studies of LPP, Graphical Methods to Solve Linear Programming Problems, Applications, Advantages, Limitations


Unit 3- Graphical Analysis of Linear Programming Problems: Introduction, Graphical Analysis, Some Basic Definitions, Graphical Methods to Solve LPP, Some Exceptional Cases, Important Geometric Properties of LPP


Unit 4- Simplex Method: Introduction , Standard Form of LPP, Fundamental theorem of LPP, Solution of LPP – Simplex Method, The Simplex Algorithm, Penalty Cost Method or Big M-method,        Two Phase Method, Solved Problems on Minimisation


Unit 5  -Duality in Linear Programming Problem: Introduction, Importance of Duality Concepts, Formulation of Dual Problem, Economic Interpretation of Duality, Sensitivity Analysis


Unit 6  -Transportation Problem: Introduction, Formulation of Transportation Problem (TP), Transportation Algorithm (MODI Method), the Initial Basic Feasible Solution, Moving Towards Optimality


Unit 7- Assignment Problem: Introduction, Mathematical Formulation of the Problem, Hungarian Method Algorithm,      Routing Problem, Travelling Salesman Problem


Unit 8- Integer Programming Problem:         Introduction, Types of Integer Programming Problems,             Gomory’s All-IPP Method, All IPP Algorithm, Branch and Bound Technique


Unit 9  -Infinite Queuing Models: Introduction, Queuing Theory, Operating Characteristics of a Queuing System, Constituents of a Queuing System, Service Facility, Queue Discipline


Unit 10-Mathematical Analysis of Queuing Theory: Introduction, Mathematical Analysis of Queuing Process, Properties of Queuing System, Notations, Service System, Single Channel Models, Multiple Service Channels, Erlang Family of Distribution of Service Times, Applications of Queuing Theory, Limitations of Queuing Theory


Unit 11 - Finite Queuing Models: Introduction, Finite Queuing Models


Unit 12 - Simulation: Introduction, Methodology of Simulation, Basic Concepts, Simulation Procedure, Application of Simulation


Unit 13 - Simulation Monte-Carlo Method: Introduction, Monte-Carlo Simulation, Applications of Simulation, Advantages of Simulation, Limitations of Simulation


Unit 14 - Project Scheduling and PERT-CPM: Introduction, Basic Difference between PERT and CPM, PERT/CPM Network Components and Precedence Relationship, Project Management – PERT


Unit 15 - Game Theory: Introduction, Competitive Situations, Characteristics of Competitive Games, Maximin – Minimax Principle, Dominance