ADCA / MCA (II Year)

Decembat,2OOT

CS-51 : OFERATIONSRESEARCH

T'ime: 3 hours Maximum Marks : 75

anY
Note r Qu estidn number 1 is compulsorY. AttemPt
thtee more quesfionsfrom quesfions numbered
2to5.

1. (a) A manufacturerproducesmachinesof Types I and II'

Each machineof Type I requires4 hours of grinding
and 2 hours of polishiog,whereaseach machine of
Type II requires2 hours of grinding and 4 hours of
polishing The manufacturerhas 2 grinders and 3
polishers. Each grinder and each polisher works
40 hours a week. profit on one machineof Type I is
Rs. 30 and the profit on one machine of Type II is
Rs. 40. Whateveris producedis sold in the market.
Formulate this problem as an Integer Linear
PrograrnmingProblem to find how many machines
of Types I land II should be produced so as to
maximize the profit per week. No need to solve the
formulatedproblem.

C S - 51
P.T.o.
 (b) In a computer centre,3 programmes A
L, A2, A, are
are to be assigned to 3 programme* prl p;, p,
whose times in writing programmes differ
and are
shown in the table below.

P, P2 P,
A1 30 7A 10
A2 50 60 20
A3 50 50' 30
Find the optimal assignment that minim
izes the total
time in writing the programmes.
(c) Describe the historical background and
scope of
Operations Research in brief.
(d) Explain the simulation technique. Give reason
for the
need to use it.
(e) Explain the terms : inventory, set-up cost,
stock out
cost, economic order quantity.
(f) In a ration shop with one server, the arrival
time of
customers has a Poisson airtriii;;
;; the
average arrival rate of 1 customer pe'r
minute while
the service time of the customers has an
exponential
distribution with the average service
rate of z
customers per minute. compute the following
:
(i) The probability that there are n (n : 0,
1, ...)
customers at the shop at any time.
(ii) The average time a customer
spends at the
shop to get his/her ration.
(iii) The probability that the server is busy.

CS.s1
 2- (a) Apply the simprexmethod to ,ou) the problem
'
Maximizez- 2x,
r * z
subjectto
*1 + *2 s 2
t t l

*1 + 2*,
X 1 , * 2 2o
. rc
b) Describethe queueingproblem. Explain the terms
:
inter-arrivaltime, time spent in the queueingsystem,
queuedisciplinein the context of a queueing
rnodel. s

3' (a) Write Kuhn-Tuckerconditionsfor the problem

M i n i m i z eiz: - - 2*xi 2 - 2*''

e.,.,
:i
subjectto
*1 + 2*,
*1' *2
and hence solveit.
I
(b) Find an optimal solution of the transportation
problem given below using the North West
Corner
Method to find an initial basicfeasiblesolution.

Destinations
1 2 3 Availability

(n 1 2 Lq La 40
a)
()
L{
=
o 2 & 1-l V 60
U)

3 Lq LA 2 30
Requirem
ent 30 50 50

CS-s1
P.T.O.
 'Explain
4. (a) the terms ; unique and multiple optimal
solutionsin the context of linear programming' Write
two simple linear programming in tvuo variablesout
of which one has a unique optimal solution and the
other one has multiple optimal solutions I

(b) Write the dual of the Problem

M a x i m i z ze: 5 * , + l}xr+ 4*,

subjectto

,. *1 + 2x, * *3
2*, *z + 3*, : 2

*1, x1i *3

'5. (a) Determine the saddle point solution indicating the

strategies for the players A and B together with, the
value of the game. The payoff matrix for the player
A is given below :

B1 B2 B3 B4

A1 8 6 2 8

A2 8 - 9 4 5

A3 7 5 3 5

(b) Use dynarnic programming technique to find the

point (V' Vr) bn, 92

4v? + 9v22: 36 which is nearestthe origin

C S . 51
14,000