Operation Research

Syllabus

BCOM602-18

UNIT-I

Introduction: Introduction to Operations Research: Basics Definition, Scope, Objectives, Phases, Models and Limitations of Operations Research.

Deterministic Models: Formulation of Linear Programming Problem, Graphical Solution of  LPP, Simplex Method, Artificial Variables, Big-M method, Transportation Problem: Formulation, Solution, Unbalanced Transportation Problem. Finding Basic Feasible Solutions, Optimality Tests, Assignment Model: Formulation, Hungarian Method for Optimal Solution, Solving Unbalanced Problem, Travelling Salesman Problem.

UNIT-II

Probabilistic Models: Decision making Under Uncertainty: Maximum and Minimum Models; Introduction to Decision tree. Game Theory: Solution of Simple Two Person Zero-Sum Games: Examples of Simple Competitive Situation.

Dynamic Programming: Introduction to deterministic and Probabilistic Dynamic Programming, Solution of Simple Problems.

UNIT-III

Queuing Theory: Types of Queuing Situation, Queuing Models with Poisson’s Input and Exponential Service, Their Application to Simple Situations.

Network Models: PERT & CPM, Introduction, Analysis of Time Bound Project Situations, Construction of Net Works, Identification of Critical Path, Slack and Float, Crashing of Network for Cost Reduction.

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, Model (b) Demand Rate Non-Uniform and Production Rate Infinite, Model (c) Demand Rate Uniform and Production Rate Finite.