M-318

OPERATIONS RESEARCH

Course/Paper : 318                                                                          Max.Marks : 70

 

MBA  Optional(D)                                                                            Time : 3 Hrs.

 

Objective:

To provide a formal quantitative approach to problem solving and an intuition about situations where such an approach is appropriate. To introduce some widely-used mathematical models. The understanding of these models will allow the students to communicate with persons who run them and to evaluate the results they present. To provide a tool that the students can use to solve management problems.

 

Section A
 

Linear Programming Problems (LPP)- An overview and scope of Operations Research,Introduction to Linear Programming (LP), Illustration of LP Problems, Formulation exercises on LP Problems, Graphical Method of solving LPP, Simplex Method, Unbounded ness, Multiple Optimum Solutions, Degeneracy and Cycling Problems, Artificial Variables : Big-M Method, Sensitivity Analysis, Duality Problem, Economic Interpretation of Simplex Tableau, Computer Software for Solving LPP. Special Types of LPP- Formulation of Transportation Problems, Sensitivity Analysis in Transportation Problems, Assignment Problem.

 

Integer and Goal Programming Problems- Formulation, Cutting Plane Method, Branch and Bound Method, Applications, Single and Multiple Goal Programming Problems

.

Markov Chains- Queuing Theory, Concepts, Transition Probabilities, Steady-State Probabilities, Applications Dynamic Programming Problems

 

Section B
 

Case and Problems