You are on page 1of 3

USN l0ME74

Seventh Semester B.E. Degree Examination, Dec.20l 4lJan.20l5


Operations Research
Time: 3 hrs. Max. Marks:100
Note: Answer FIVE fuII questions, selecting
i) at leqst TWO questions from each poit.
o
o
PART _ A
ci
E
q
la. De fine,operations research. n*p uin @ffi f operations research. (06 Marks)
b. A firm manlfactures two products A and B on which the profit earned per unit are ' 3 and
d) ' 4 respectively. Each product is processed on two machines Mr and M1. Product A requires
6J

one minute of processing time on M1 and two minutes on Mz while B requires one minute
on Mr and one minute on M2. Machine Mr is available for not more than 7 hrs. 30 mins
while machine M2 is available for 10 hrs during any working day. Find the number of units
cae
-.o
of product A and B to be manufactured to get maximum profit. (14 Marks)
50

a. Solve the lollowing LPP using sirnplex method:


:.) Maximize Z:3x, + 2x"
-u
o> Subject to constraints x, + x, < 4
9-
x,-x' <2
x1.X2>0 (10 Marks)
o(j b. Solve the given problem by using Big-M method:
Maxinrize Z:-2xr-xz j

Subject to constraints 3x, + x, = 3


d=
4x, +3x. > 6
3A xr +2x, <4 and
OE
l:\ ' X1'XZ)O' (10 Marks)
to-
o.!
a=
o:
3 a. ABC li'mited has three production shops supplying a product to 5 warehouses. The cost of
production varies from shop to shop, .osf bf transportation from shop to shop, cost of
=* transporlation from shop to warehouses also varies. Each shop has a specific production
o.-
>\'+ capacity of eacli warehouse has certain amount of requirement. The cost of transportation
-^o
are as given below:
Warehouse
F> Shop Capacity Cost for production
o_
I II iII IV V
U< A 6 4 4 7 5 r00 t4
B 5 6 7 4 8 125 16
1 1
0) C J 4 6 J 4 175 t5
o
'7
Requirement 60 80 85 105 70
Find the optimum quantrty to be supplied from each shop to different warehouse at
o minimum cost.
o, (12 Marks)
c

1 of3
10ME74
b. A ABC company has 5 tasks and 5 persons to perform. Determine the optimal assignment
that n'rinimizes the total cost.
Machines
Jobs
A B C D E
P 6 7 5 9 4
o 7 5 l0 9 6
a
R 5 4 J 6 5
a
S 8 J 5 6 4
T 4 7 5 6 6
(08 Marks)

4 a. Explain the importance of integer programming. (05 Marks)


b. Solve the following linear programming by Gomory technique:
Maximize Z=xr4xt
Subject to 2x, + x., < 6
4x, +5x, < 20
Xr, X2 ) 0 and integers. (15 Marks)

PART _ B
5a. Define the following:
i) Normal time
il) Crash time
iiD Free float .: (06 Marks)
b. R and D activity has 7 activities for which the three time estimates are given below aiong
w th it di ac it
Activity Preceeding activity Optimistic time Most likely time Pessimistic time
(a) (rn) (b)
A 4 6 8
B A 6 t0 t2
C A 8 18 24
D B I 9 9
E C l0 T4 18
F A 5 5 5
G D.E.F 8 10 t2
i) Draw PERT network.
it Find EST, LST and slack for each node.
iii) Find criticalpath and expected project duration. (14 Marks)

6a. Briefly explain queuing system and its characteristics. (06 Marks)
b. Arrival rate of telephone calT at a telephone booth are according to Poisson distribution, with
an average time of 9 minutes between two consecutive anivals. The length of telephone call
is assumed to be exponentially distributed, with mean 3 minutes.
i) Determine the probability that a person an-iving at the booth will have to wait.
ii) Find the average queue length.
iii) The telephone company will install a second booth when convinced that an arrival
would expect to have to wait at least four minutes for the phone. Find the increase in
flow rate of arrivals which will justify a second booth.
iv) What is the probability that he will have to wait for more than 10 minutes before the
Photte is free? (14 Marks)
2 of 3
1OME74

7 a. Explairt clearly the following terms:


il Pay off matrix
ii) Saddle point
iii)Fair game (06 Marks)
b. use dominance rule to find the optimum strategies for both the player.
Br 82 83 84 85 86
02 11
13 22 l

(07 Marks)
7 -5 t2
4 -1 22
,:':."',
i,.r 3-2 22
c. Solve the I method:
I

I
L

'
(07 Marks)

8 a. Define: (i) Total elapsed tinre, (ii) Idle time. (04 Marks)
b. List the assumption made while dealing with sequencing problem. (04 Marks)
c. We have five jobs each of which muit go through the machines A, B and C in the order
ABC. Determine a sequence fB{ jo-b thar will minimize the total elapsed time and idle time
for each machine.
;Prbcessing time in houis
Job number" a
I 2 J 4 5
Machin'O A 5 7 6 9 5
1
Maehine B 2 I 4 5 ..'
a
Machine C J 1 5 6 "7

(12 Marks)
J

,F****
ir.-

3 of3