M.B.A. I (Semester II) (CBCS) Examination, 2017
OPERATIONS MANAGEMENT (Paper XVI)
Day and Date Thursday, 25-5-2017 Total Marks 70
Time 2.30 p.m. to 5.00 p.m.
Instructions Question No. 1 is compulsory.
Attempt any 2 questions from Q. Q. 3 and Q. 4.
Attempt any 2 questions from Q. Q. 6 and Q. 7.
Use of ordinary calculate is allowed.
Use of graph paper whenever required.
1. A construction company wants to transfer the construction materials from
warehouse to the project site; using two special trucks A and B. Truck A carry
1 ton of cement and 4 tonnes of steel in one trip and truck B carries 2 tonnes of
cement and 3 tonnes of steel at a time. The construction work needs 6 tonnes of
cement and 12 tonnes of steel daily. Due to limited number of drivers only 10
trips can be made to site daily. The cost of one trip of A and B is Rs. 500 and
Rs. 700 respectively. How many trips for each truck be planned daily so as to
minimize transportation cost. Formulate the problem a as L.P.P. and solve using
graphical method for maximum profit. 14
2. Solve any two of the following 14
Suggest the decision under Laplace criterion for the follwing matrix where the
figures indicate estimated gain in Rs.
Strategies I II III IV
A 50,000 25,000 − 25,000 − 45,000
B 70,000 30,000 − 40,000 − 80,000
C 30,000 15,000 − 1,000 − 10,000
A self-service store employs one cashier at its counter. Nine customers
arrive on an average every 5 minutes while the cashier can serve 10 customers
in 5 minutes, Assuming Poisson distribution for arrival rate and exponential
distribution for service rate. Find
Average number of customers in the system.
ii) Average number of customers in the queue.
iii) Average time a customer spends in the system.
What do you mean by Markov chain Explain the concept with its applications.
3. Solve any two of the following 14
Solve the following game and find optimal strategies and value of game.
X
1 2 3 4 5
Y
1 9 3 1 8 0
2 6 5 5 6 7
3 4 3 3 8
4 5 6 2 2 1
Write a note on Queuing cost with diagrammatic representation.
What do you mean by Operations Management Explain the various Phase
of Operations Management.
4. Solve any two of the following 14
Use the graphical method to solve the following Linear Programming Problem.
Maximize Z 15x1 10 x2
Subject to 4x1 6x2 360
3x1 180
5x2 200
where x1, x2 0
6
A computer centre has three expert programmers. The centre wants three
P2, P3) application programmes to be developed. The head of the
computer centre, after studying the programmes to be developed, estimates
the computer time in minutes required by experts for application programmes.
Programmers
Programes
A B C
P1 120 100 80
P2 80 90 110
P3 110 140 120
Assign programmers to the programmes P2, P3) such that the
total computer time is minimum. Use Hungerian method.
Write short notes on Monte Carlo Simulation.
5. A dairy firm wants to determine the quantity of butter it should produce to meet
the demand. Past records has shown the following records. 14
Quantity Required Probability
15 0.03
20 0.07
25 0.10
30 0.40
35 0.20
40 0.15
50 0.05
The stock levels are restricted to the range of 15 to 50 kg due to inadequate
storing facilities. Butter costs Rs. 40 per kg and sold at Rs. 50 per Kg.
Construct a conditional profit table.
ii) Determine EMV.
6. Solve following transportation problem by using VAM method. Check its Optimality
by using MODI method. 14
D1 D2 D3 D4 Supply
P1 5 3 6 4 30
P2 3 4 7 8 15
P3 9 6 5 8 15
Demand 10 25 18 7
7. A certain equipments need 5 repair jobs which have to be assigned to 5 machines.
Determine the minimum assignment time. 14
J1 J2 J3 J4 J5
M1 7 5 9 8 11
M2 9 12 7 11 10
M3 8 5 4 6 9
M4 7 3 6 9 5
M5 4 6 7 5 11