Printed Pages : 7 MCA.

315

lbllorving Paper ID and Roll No. to be filled in your Answer Book

RollNo.

M. C"A.
(Semester-IlD Theory Examination, 2Lfl'12
\,
COMPUTER BASED OPTIMIZATION TECHNIQUES

Time : 3 IIoursJ [Total Marks : 100

Note : This question paper contains three Sections'

Section-A contains very short-answer type
questions, Section-B medium-answer type
questions and Section-C contains descriptive-
answer tYPe questions.

Section'A

Attempt all par:ts of this question. 2xl}:20

1. (a) Define inventory. What are the various
types of inventorY?

(b) What is Economic Order QuantitY?

(c) What do you mean by Linear Programming?
Describe the limitations of L.P.
 (d) What do you mean by sensitivity analysis?
(e) What is the degeneracy in L.p. problem?
(0 Describe briefly the main steps in the basi
procedure of rnodified distiibution method.

(g) Explain Dynamic programming. State it

applications.
(h) Enumerate the investment portfolio selection
problem as a quadratic programming problem.

(i) What is Queueing Theory?

0) Describe Poisson distribution.

Section-B

There are five questions in this section. Atternpt

any three questions. l0x3:30
2. Solve the L.P. problem :

Minimize: Z=x1-3x2+24
Subject to the constraints :

3xi - x2 +34 37
-2x1+ 4x2 <12

-4x1+3x2+8x3 < 10

and X1, X2, x3 > 0.

7312 (2)
ir
rI
"t
i/
 3. A factory needs 36,000 units annually of a

component that cost Rs. 2 per unit. Cost of each

order placing is Rs. 25 and inventory carrying
cost is Rs. 10 per year.

(i) Find the economic lot size and the total

: inventory cost.
(ii) What is the time between placing of order?
4. State the assignment problem. Describe a method
of drawing number of lines in the context of
assignment problem. Name the method.

5. Use Wolfe's method to solve the quadratic

programming problem :

Maximize : Z =2\+3x2-2x12

Subject to the consraints :

x1*4x2 <4

\'t x2 <4
and x1t x2 >0.

6. Show that inter-arrival times are distributed

exponentially, if arrival is a Poisson procass.

7312 (3)
 There are five questions
in this seetion. AttemPt
10x 5:50
a// questions.
7. AttemPt any one Part :
(a) ' :
rventorY model with one Price
the decision ro'
:r."'il"fi'lotu"' 'ul"'
finding oPtimal order quantitY'
Describe the problem of
inventory control'
(b)
when the stochastic demand
is uniform'
production of commodity is instantaneous
and lead time is negligible'

8. AttemPt any one Part :

of belts' Belt
(a) A cornpany makes two kinds
B is of lower
A is of high quality and belt
are Rs' 8 and
quality. The respective profits
per belt. Each belt of type
A reluirll
Rs. 6
twice as much time as belt of type B and if
company could
all belts were of type B' the
The supply of
make 1,000 belts per day'
leatherissufficientforonly800belts(both
A and B combined)' Belt A requires
a

such buckles are

fancy buckle and only 400
available per day' Three are only 700

7312
(4) i
.i
 buckles ; day available for tYPe ts'
Determine the number of belts to be
)"
produced for each type so as to maximize
profit. Formulate and solve the problem
graPhicallY.
the
I
(b) Use two phase simplex method to solve
b problem: ,

Mnimize: l5l2x1-3x2
Subject to the constraints :

'3x1- x2 \.t
- x3 '
xt*x2+4>2
and x1, x)> x3 20

g. AttemPt any one Part :

Explain the' geometrical interpretation of

I

i
(a)
Branch and Bound method by solving the
following Integer Linear programming :

Maxirnize : Z=x1'lx2

Subject to the constraints :

3x1+2x2312

xt? xz20 and are integer'

7312 (s)
 (b) Determine an initial basic feasible solution
to the transportation problem, where Q
and D j represent ith origin and jth
destination respectively.

Dr D2 D3 D4 Supply
q 4 T4
O2 8 9 2 7 t6
a
O3 4 J 6 2 5
Demand 10 15 35

10. Attempt any one part :

(a) What is the d.ynamic recursive relation?

State the 'principle of optimality' in dynamic
programming and give a mathematical
formulation of D.P.
(b) Use dynamic programming to solve the
L.P.P. :

Maximize: Z=xt+gx2
Subject to the constraints :

2x1+ x2 <25

x23ll
x1, x2) Q .

7312 (6)
11. Attempt any one part :

(a) Derive the Poisson distribution formula.

(b) Arrival rate of telephone calls at a

telephone booth is according to Poisson

distribution, with an average time of 9
minutes two consecutive arrivals. The
lengths of telephone calls is assumed to be
exponentially distributed with mean 3 j
minutes.
{,

(i) Determine the probability that a ili

ll

person arriving at the booth vvill have

il

to wait. ll,

Find the average queue length that I

forms time to time.

I
I
I
it

it
7312-7-5,540
it
ii
,--')