# SMU MBA ASSIGNMENTS

## SMU MBA 2 SEMESTER MB0048 OPERATIONS RESEARCH FALL 2015-2016

SMU MBA FALL 2015 -2016

Dear Students,

SMU MBA FALL   2015-2016 Assignments are available. For Booking ,Kindly mail us on kvsude@gmail.com OR call us to +91 9995105420  or S M S your “ Email ID ” us in the following Format  “  On +91 9995105420 we will reach back you with in 24H ”

ASSIGNMENT

 DRIVE FALL 2015 PROGRAM MBA/ MBADS/ MBAFLEX/ MBAHCSN3/ PGDBAN2 SEMESTER II SUBJECT CODE & NAME MB0048 OPERATIONS RESEARCH BK ID B2068 CREDITS 4 MARKS 60

.

 Q.No Questions Marks Total Marks 1 Describe the framework of Operations Research. A List the seven stages of Operations Research Briefly explain seven stages of Operations Research 1.25 8.75 (1.25 marks for each stage) 10 2spring 2015 a.  Explain the graphical method of solving Linear Programming Problem. b.    A paper mill produces two grades of paper viz., X and Y. Because of raw material restrictions, it cannot produce more than 400 tons of grade X paper and 300 tons of grade Y paper in a week. There are 160 production hours in a week. It requires 0.20 and 0.40 hours to produce a ton of grade X and Y papers. The mill earns a profit of Rs. 200 and Rs. 500 per ton of grade X and Y paper respectively. Formulate this as a Linear Programming Problem. A a.  Explain the concept of linear programming Describe the graphical method of solving Linear Programming Problem b.  Frame/formulate the LPP (Objective function & Constraints) 2 4     4 10

 10 9 7 8 5 8 7 7 5 4 6 5 2 3 4 5

3 a.  Explain some of the important terms of the transportation problem.

b.  Explain the steps of MODI (Modified Distribution) method.

A a.       List and briefly explain some of the important terms of the transportation problem

b.      Describe the procedure of MODI method

2

8

10
4 a.  Explain the steps involved in Hungarian method of solving Assignment problems.

b.  Find an optimal solution to an assignment problem with the following cost matrix:spring2015

J1                         J2                         J3                         J4

M1 M2 M3 M4

A a.List the steps in Hungarian method b.Solve/ Compute the solution to the problem 4

6

10
5 a.  Explain Monte Carlo Simulation.

b.  Hindustan Bakery is popular for its delicious fruit cakes. The table below shows the

daily demand for the bakery’s cakes.

 Daily Demand 0 15 25 35 45 50 Probability 0.01 0.15 0.2 0.5 0.12 0.02

Simulate the demand for cakes for 10 days using the following sequence of random numbers:

22, 26, 48, 53, 93, 89, 42, 91, 25, 20

If 35 cakes are baked every day in Hindustan Bakery, determine the inventory stock. In addition, estimate the daily average demand for cakes on the basis of simulated data.

A a.  Explain what is Monte Carlo Simulation and list the steps of of Monte Carlo Simulation

b.  Solve/ Compute the solution to the problem

5

5

10

 6 a.  State the assumptions of game theory. b.  What are the characteristics of Markov chain? c.  What are the rules for prioritising jobs? A a.List the assumptions of game theory b.List the characteristics of Markov chain c.List and briefly explain the rules for prioritising jobs 3 3 4 10

Note –Please provide keywords, short answer, specific terms, specific examples and marks break – up (wherever necessary)

Note –Answer all questions. Kindly note that answers for 10 marks questions should be approximately of 400 words. Each question is followed by evaluation scheme

SMU MBA FALL 2015 -2016

Dear Students,

SMU MBA FALL   2015-2016 Assignments are available. For Booking ,Kindly mail us on kvsude@gmail.com OR call us to +91 9995105420  or S M S your “ Email ID ” us in the following Format  “  On +91 9995105420 we will reach back you with in 24H ”