Mumbai University Questions Papers Solution Page Numbers

from Prof. Vikram Shrotri’s Book on Operations Research - Second Edition,

Published by Sheth Publication for VI th Semester TYBMS
3. A. Following payoff matrix refers to a two player game, player A and player B. Each player has four
strategic options. Pay-off in Rs. 10,000/-
Player B

 450 230 200 300 

I II III IV
I
Player A II
 –50 –80 –40 240

 450 380 200 300 
III 280 320 150 60
IV

i) Find the Maximin Strategy. (3)

ii) Find the Minimax Strategy. (3)
iii) What is the value of the Game? (1)
(For Solution Refer Page Nos. 329 – 330)

3. B. There are five jobs (namely 1, 2, 3, 4 and 5), each of which must go through machines A, B and C in
the order ABC. Processing Time (in hours) are given below :
Jobs 1 2 3 4 5
Machine A 5 6 6 9 6
Machine B 3 2 5 5 3
Machine C 3 7 5 6 7
i) Find the sequence that minimizes the total elapsed time required to complete the
jobs. (2)
ii) Calculate the total elapsed time (3)
iii) Idle time on Machine A, Machine B and Machine C. (3)
(For Solution Refer Page Nos. 312 – 313) OR
3. C. Five salesmen are to be assigned to five territories. Base on past performance, the following table
shows the annual sales (is Rs. lakh) that can be generated by each salesman in each territory. Find
optimum assignment to maximise sales. (7)
Sales Territory
Man T1 T2 T3 T4 T5
S1 24 12 8 10 7
S2 29 25 28 12 14
S3 13 16 14 23 28
S4 15 10 19 28 23
S5 18 17 23 14 8
(For Solution Refer Page Nos. 133 – 134)
MU October 2019 Page 4
 Mumbai University Questions Papers Solution Page Numbers
from Prof. Vikram Shrotri’s Book on Operations Research - Second Edition,
Published by Sheth Publication for VI th Semester TYBMS
3. D. Use Simplex method to solve the following Linear programming problem (8)
Maximize Z = 4x1 + 7x2
Subject to the constraints,
x1 + 3x2  18
4x1 + 2x2  8
x1  0 , x2  0
(For Solution Refer Page Nos. 71 – 72)

4. A. The table given below has been taken from the solution procedure of a transportation problem,
involving minimization of cost (in Rs.)

Stockists Monthly Capacity

Factories (units)
P Q R
A 4 8 8 55

30 25
B 18 24 18 88

44 44
C 12 16 24 77

77
Monthly 74 102 44 220
Demand
(Units)

i) Show that the above solution is optimal. Find an optimal solution. (3)
ii) Does the problem have multiple optimal solutions? Give reasons. (2)
iii) If multiple solution exists, then find one more optimal solution. (3)
iv) Comment upon the managerial significance of multiple optimal solutions (2)
(For Solution Refer Page Nos. 197 – 199)

4. B. A company is making a chart to decide the minimum amount of constituents like proteins, vitamins,
carbohydrates, fats etc. Which a man needs on daily basis to fulfil his requirement for medical
awareness. The choice is to be made from different type of foods (4 types). The yields per unit for
different types of foods are explained below in the chart. Formulate the given linear programming
problem. (5)
MU October 2019 Page 5
 Mumbai University Questions Papers Solution Page Numbers
from Prof. Vikram Shrotri’s Book on Operations Research - Second Edition,
Published by Sheth Publication for VI th Semester TYBMS

3. D. Two firms, Lacko textile and Rayon textiles have 3 strategies each to select from. The
3 strategies are no advertisement, using moderate advertising and using heavy advertising. You are given the pay
off matrix from view point of Lacko textiles, showing its market share under several combinations of strategies :
Pay-off in Rs. 10,000/-

Rayon textiles

 
No advt (I) Mod advt (II) Heavy advt (II)

 
No advt (I) 50 40 28
Lacko textiles Mod advt (II) 70 50 45
Heavy advt (III)  
75 52 50
i) Find the saddle point and value of game. (2)
ii) Comment on the strategy to be selected by both the companies. (5)
(For Solution Refer Page Nos. 325 – 326 )

4. A. You are given a solution for a transportation cost problem. Figures in each cell represent per unit transportation
cost. Figures in circle within each cell represent number of units allocated for transportation. X, Y and Z are the 3
factories and A, B, C and D are the 4 customers.

A B C D Supply

200
X 13 7 19 0 200

120 380
Y 17 18 15 7 500

180 100 20
Z 11 22 14 5 300

Demand 180 320 100 400

i) You are required to check the above solution for optimality. (3)
ii) If it is not optimal, use modified distribution method to obtain optimal solution. (3)
iii) Find optimal transportation cost. (2)
(For Solution Refer Page Nos. 182 – 184)

MU May 2019 Page 5

 Mumbai University Questions Papers Solution Page Numbers
from Prof. Vikram Shrotri’s Book on Operations Research - Second Edition,
Published by Sheth Publication for VI th Semester TYBMS
B. You are given the following information for a project with 8 activities :

Node Normal Duration Crash cost per Maximum possible

(days) Day (Rs.) Crash time

1-2 6 80 2

1-3 8 90 4

1-4 5 30 2

2-4 3 - 0

2-5 5 40 2

3-6 12 200 4

4-6 8 50 3

5-6 6 - 0

The cost of completing the eight activities in normal time is Rs. 6,500.

Indirect cost is Rs. 160 per day. The contract includes a penalty of Rs. 100 per day for every day of delay more than 17
days.
i) Draw the network diagram and final critical path. (3)
ii) Crash the project duration to find the total cost of completing the project in 17 days (4)
(For Solution Refer Page No. 259)
OR
4. C. A company produces 2 products x1 and x2 using three resources S1, S2 and S3. Product x1 gives profit of Rs. 30
per unit and product x2 gives profit of Rs. 40 per unit. The 3 resources S1, S2 and S3 are available to the extent of
200 units, 600 units and 500 units respectively.
The following objective function and constraints are given to you:
Max Z = 30x1 + 40x2

Subject to constraints :
x1 + 2x2  200
8x1 + 5x2  600
3x1 + 4x2  500
x1  0; x2  0

You are given the following simplex solution to the above problem :

Cj  30 40 0 0 0

C X B x1 x2 S1 S2 S3

40 x2 100 1/2 1 1/2 0 0

0 S2 100 11/2 0 (-)5/2 1 0

0 S3 100 1 0 (-)2 0 1

Zj  20 40 20 0 0
 Mumbai University Questions Papers Solution Page Numbers
from Prof. Vikram Shrotri’s Book on Operations Research - Second Edition,
Published by Sheth Publication for VI th Semester TYBMS

A. With reference to the above table answer the following :

i) Check if the above solution is optimal or not. (2)
ii) If it is not optimal, find optimal solution. (5)
B. With reference to the optimal simplex table in the above problem obtained by you, answer the following :
iii) Find the optimal product mix and optimal profit (2)
iv) Which resources are scarce and which are unutilized? (2)
v) Is it a case of alternative solution? Justify your answer (2)
vi) What are the shadow prices of the resources? Justify. (2)
(For Solution Refer Page Nos. 104 – 105)

5. A. Explain the concepts: Total float, Free float, Independent float and Interfering float. (8)
Answer : [Ref. Page Nos. 236 - 237]

B. Discuss any 5 areas where techniques of operations research can be applied. (7)
Answer : [Ref. Page Nos. 6 - 8]
OR

C. Answer any 3 of the following : (15)

i) Explain the terms: Redundant constraint and infeasibility in linear programming .
Answer : [Ref. Page Nos. 44 - 45 and 47 ]

ii) What do you mean by alternative optimal solution in transportation? How do you identify alternative
solution in a transportation problem? Further what is the procedure to find that alternative solution?
Answer : [Ref. Page Nos. 195 - 196 ]

iii) Explain time cost trade off in project crashing.

Answer : [Ref. Page Nos. 246 – 247 ]

iv) Discuss the significance of theory of games. Briefly discuss the terms: Players and Pay off.
Answer : [Ref. Page Nos. 320 - 321]

v) Distinguish between PERT and CPM.

Answer : [Ref. Page Nos. 224]

MU May 2019 Page 7

 Mumbai University Questions Papers Solution Page Numbers
from Prof. Vikram Shrotri’s Book on Operations Research - Second Edition,
Published by Sheth Publication for VI th Semester TYBMS

iii) Explain “Infeasibility” in Graphical Method of LPP. Explain with sketch. (2.5)
Answer : [Ref. Page Nos. 44 - 45]

2. Attempt any two questions :

a) Four jobs are to be assigned to four workers on one to one basis. Cost of each assignment is
given in Rs. Thousands. Find optimal assignment of job and worker to minimize total cost.
(7.5)
Jobs A B C D
Workers
Sunil 3 6 4 5
Jainil 12 7 6 5
Anil 2 9 4 3
Swapnil 6 4 3 2
(For Solution Refer Page Nos. 125 – 126)

b) There are 3 Factories A, B, C and three Markets X, Y and Z. Supply at the factories is 60, 80
and 85 units. Demand at the market places is 75, 110 and 40 units. The supply and Demand
of units with unit cost of Transportation (in Rs.) and the schedule followed from factories to
Markets are given below :
(The numbers which are shown in circle indicates numbers of units transported from
factories to Markets.)
(Cost in Rs.)
Markets X Y X Supply
Factories
A 6 3 5 60
35 25

B 5 9 2 80
40 40

C 10 7 8 85
85

Demand 75 110 40 225

i) Test the given solution for optimality and find optimal Transportation solution.
(03)
ii) Find one more optimal alternate Transportation solution. (4.5)
(For Solution Refer Page Nos. 196 – 197)
 NORMAL DISTRIBUTION TABLE

Areas Under the Standard Normal Distribution

0.01 0.02 0.03 0.04 0.05 0.06 0.07 0.08 0.09

0.0 0.0000 0.0040 0.0080 0.0120 0.0160 0.0199 0.0239 0.0279 0.0319 0.0359
0.1 0.0398 0.0438 0.0478 0.0517 0.0557 0.0596 0.0636 0.0675 0.0714 0.0753
0.2 0.0793 0.0832 0.0871 0.0910 0.0948 0.0987 0.1026 0.1064 0.1103 0.1141
0.3 0.1179 0.1217 0.1255 0.1293 0.1331 0.1368 0.1406 0.1443 0.1480 0.1517
0.4 0.1554 0.1591 0.1628 0.1664 0.1700 0.1736 0.1772 0.1808 0.1844 0.1879
0.5 0.1915 0.1950 0.1985 0.2019 0.2054 0.2088 0.2123 0.2157 0.2190 0.2224
0.6 0.2257 0.2291 0.2324 0.2357 0.2389 0.2422 0.2454 0.2486 0.2517 0.2549
0.7 0.2580 0.2611 0.2642 0.2673 0.2704 0.2734 0.2764 0.2794 0.2823 0.2852
0.8 0.2881 0.2910 0.2939 0.2967 0.2995 0.3023 0.3051 0.3078 0.3106 0.3133
0.9 0.3159 0.3186 0.3212 0.3238 0.3264 0.3289 0.3315 0.3340 0.3365 0.3389
1.0 0.3413 0.3438 0.3461 0.3485 0.3508 0.3531 0.3554 0.3577 0.3599 0.3621
1.1 0.3643 0.3665 0.3686 0.3708 0.3729 0.3749 0.3770 0.3790 0.3810 0.3830
1.2 0.3849 0.3869 0.3888 0.3907 0.3925 0.3944 0.3962 0.3980 0.3997 0.4015
1.3 0.4032 0.4049 0.4066 0.4082 0.4099 0.4115 0.4131 0.4147 0.4162 0.4177
1.4 0.4192 0.4207 0.4222 0.4236 0.4251 0.4265 0.4279 0.4292 0.4306 0.4319
1.5 0.4332 0.4345 0.4357 0.4370 0.4382 0.4394 0.4406 0.4418 0.4429 0.4441
1.6 0.4452 0.4463 0.4474 0.4484 0.4495 0.4505 0.4515 0.4525 0.4535 0.4545
1.7 0.4554 0.4564 0.4573 0.4582 0.4591 0.4599 0.4608 0.4616 0.4625 0.4633
1.8 0.4641 0.4649 0.4656 0.4664 0.4671 0.4678 0.4686 0.4693 0.4699 0.4706
1.9 0.4713 0.4719 0.4726 0.4732 0.4738 0.4744 0.4750 0.4756 0.4761 0.4767
2.0 0.4772 0.4778 0.4783 0.4788 0.4793 0.4798 0.4803 0.4808 0.4812 0.4817
2.1 0.4821 0.4826 0.4830 0.4834 0.4838 0.4842 0.4846 0.4850 0.4854 0.4857
2.2 0.4861 0.4864 0.4868 0.4871 0.4875 0.4878 0.4881 0.4884 0.4887 0.4890
2.3 0.4893 0.4896 0.4898 0.4901 0.4904 0.4906 0.4909 0.4911 0.4913 0.4916
2.4 0.4918 0.4920 0.4922 0.4925 0.4927 0.4929 0.4931 0.4932 0.4934 0.4936
2.5 0.4938 0.4940 0.4941 0.4943 0.4945 0.4946 0.4948 0.4949 0.4951 0.4952
2.6 0.4953 0.4955 0.4956 0.4957 0.4959 0.4960 0.4961 0.4962 0.4963 0.4964
2.7 0.4965 0.4966 0.4967 0.4968 0.4969 0.4970 0.4971 0.4972 0.4973 0.4974
2.8 0.4974 0.4975 0.4976 0.4977 0.4977 0.4978 0.4979 0.4979 0.4980 0.4981
2.9 0.4981 0.4982 0.4982 0.4983 0.4984 0.4984 0.4985 0.4985 0.4986 0.4986
3.0 0.4987 0.4987 0.4987 0.4988 0.4988 0.4989 0.4989 0.4989 0.4990 0.4990