ADCA / MCA (II Year)

O
Lr) Term-End Examination
1\
cf) |une, 2009
O
CS-51 : OPEARATIONS RESEARCH

Time : 3 hours Maxintum Marks : 75

Note : Questionnumher1 is compulsory. Attempt any three
fltorequestions
fro* questionsnunthered
2 to 5.

L. (u) An oil engine manufacturer purchases 4

lubricants at the rate of Rs. 42 per piece
from a vendor. The requirement of these
lubricants is L,800per year. What should
be the order quantity per order, if the cost
per placement of an order is Rs. 16 and
inventoty cartying charge per rupee per
year is only 20 paise.
(b) Why Simulation ? What are steps in 4
simulation.
(.) Define the following terms : 5
(i) Poissonprocess
(it) Sequencing
(iir) Convex and concave functions
(i") Optimal return
(") Transient state

cs-51 P.T.O.
 (d) Use two-phase method to 1"0
Minimize Z:7.5xt-3*z
Subject to the constraints
3*t- x2- xu>-3,
n 1- x 2 - lx t - Z ,
X y X 2 rx t 2 0
(") Write a short note on the importance of
Operations Research in Project
Management.
(f) The number of customers arriving at a
facility for service between 1-0A.M. and
11 A.M. is a random variable, say Xt, with
Poisson distribution with mean 2. Similarly,
the number of customers arriving between
11 A.M. and12 Noon, say X2, has a Poisson
distribution with mean 6. If Xt and X, are
independent, what is the probability that
more than 5 customers will come between
10 A.M. and 12 Noon.

2. (u) Use dynamic programming to solve the

following L.P.P. :
Maximize Z:3xt*5x,
Subject to constraints :
x'r.'4,
x2'6,
3xt*2x2<18 and x1, x2>-A

cs-5L
 (b) A departmental head has four subordinates,
and f our tasks to be Performed. The
subord.inatesdiffer in efficiency dnd the
tasks differ in their intrinsic difficulty. His
estimate,of the time each man would take
to perform each task is given in the matrix
below :
Men
Tasks
G H
A 18 26 77 11
B 13 28 14 26
C 38 19 18 15
D 19 26 24 10

How should the tasks be allocated, one to

a man, so as to minimize the total man -
hours ?

3. (u) Use'the Kuhn - Tucker conditions to solve

the following nm - Linear programming
problem :

Maximize Z=2\- xrz+ x,

Subjectto the constraints

2xr* 3xr<6,

2xr* x2.4,

Xr, Xr-}.

cs-5L
 (b) At a railway station only one train is
handled at a time. The railway yard is
sufficient only for two trains to wait while
other is given signal to leave the station.
Trains arrive at the station at an average
rate of 6 per hour and the railway station
can handle them on an average of 12 per
hour. Assuming Poisson arrivals and
exponential service distribution, find the
steady - state probabilities for the various
number of trains in the system. AIso find
the average waiting time of. a new train
coming into the yard.

4. (a) Find the optimum order quantity for a

product for which the price breaks are as
follows :

Quantity Purchasingcost
per unit (Rr.)

o<Q1 <100 20

100sQ2<200 1B

2 0 0s Q , L6

The monthly demand for the product is 400

units. The storage cost is 20 % of the unit
cost of the product and the cost of ordering
is Rs. 25.00 per month

cs-51 P.T.O.
 (b) Two firms are competing for businessunder
the condition so that one firm's gain is
another firm's loss. Firm A's payoff matrix
is given below :
Firm B
Medium Heavy
No ad
ad ad
No advertisinev l
(n 5 -'l
Firm A Medium advertising 12 lsl
lt3
Heavy advertising U6 14 t0)

5. (u) Define the following terms and give one

example of each :
(i) Probability Distribution
(ir) Separablefunction
(iii) M/Ek/I Queueing model
(i") PERT and CPM
(b) Solve the following I-.P.P. by simplex
method :
Minimize Z : xt - 3x2* 3xg,

Subjectto. 3*r- xz* 2xu37,

Zxr* 4xr7 -L2,
- 4*r*3x2* 8rrsL0,

xy x2r xr20.

-oOo-

CS-51 5