MCA COMPUTER BASED OPTIMIZATION TECHNIQUES (10x2:20)

832 downloads 2011 Views 1MB Size Report
(a) "Computer based optimization techniques are aid for the executives in ... the needed quantitative inforrnation based on the scientific method analysis"" ...
Printed Pages---4

MCA315

(Following Paper ID and Roll No. to be filled in yourAnswer Book

Roll No.

ttttt

MCA (SEM. III) ODD SEMESTERTHEORY

EXAMINATION 2A12_13 COMPUTER BASED OPTIMIZATION TECHNIQUES Time

: 3 Hours

Tbtal Marks

:

100

Note :- Attempt all questions. All questions carry equal marks.

l.

Attempt any two ofthe following

(a)

:

(10x2:20)

"Computer based optimization techniques are aid for the executives in making their decisions by providing them with the needed quantitative inforrnation based on the scientific

method analysis"" Discuss the statement with

the

techniques and methods you know.

(b)

Afirm manufactures two productsA

and B, both of which

have to be processed on two machines M, and M". Product

A requires 4 hours each on both machines, while product B requires 6 hours on machine M, and 2 hours on machine

Mr. The available hours on machine M, and M" are 24 and

profit per unit is estimated at Rs. 1 00 for product A and Rs. 125 for product B.What quantity of each product be produced to maximize profit? 16 respectively. The

(c)

A farm is engaged in breeding pigs. The pigs are fed

on

various products grown on the farm. In view ofthe need to ensure certain nutrient constituents MCA315/DUI-44I81

it is necessary to buy lTurn Over

i;,two products say A and B in additioa' Th9 cq3tentl' of given various products, per uni! in nutrient constituents are inthe followingtable Nutrients

:

Nutrient Content in Product

A 36

6

M2

J

T2

M3

20

l0

if proaucta

ofnutrient required

B

Mr

Minimurltamount

1

08 36

1

00

costs Rs. 20 and B Rs' 40 per unit, how much

so that total each ofthese two products should be bought

cost is minimized ?

2.

Attempt any two ofthe following

(a)

:

(10x2:20)

while Discuss the ways to identiff the following situations solving L.P"P.

(D (ii)

lnfeasibleProblem UnboundedProblern

(iii) Iv{ultiPleoPtima (iv) Redundantconstaints

(v)

Degenerate Problem'

company uses rivets at an approximate Rs' 30 customer rate of 2,500 kg per year' Each unit costs it costs per kg and the company personnel estimate that cost of Rs. 130 to place an order, and that the carrying orders inventory is 10%' per year' How frequently should size of for rivets be placed ? Also determine the optimum

(b) An aircraft

each other.

MCA3ISIDLT-4418r

,(q),,:ls]vt,,.by,.l!,,ll,jg,,hic;\4,,+rth"o-.L,ttr8,,f,:Jlgylre linear prograrnmingproblem:

-2xr-,\, ,sub3e.ct!o' .,, , 3E+L:3 .MaxZ7

.

li

4;r,+3xn?6

xr+24
0. (c)

Write algorithm or program forN-W corner method to solve any transportation Problem.

4.

Attempanytwo ofthefollowing:

(10x2=20)

(a)

Whatdoyouunderstandbyaqueue? Give some important applications ofqueue.

O)

A car hire company has one car at each of five depots

a, b,

c, d, and e. A customer requires a car in each town, namely

A, B, C, D and E. Distance (in kms) between

14643157p11-4{rtl

depots

lTurn Over

(origins) and towns (destinations) are given in the following distance matrix

:

C

160 130 175 190 200 t35 120 130 160 17s 140 110 155 170 185

D

50

50

80

80

E

55

35

70

80

A B

How should cars be assigned to customers

105

so as to

minimize

the distance travelled ?

(c)

Solve the following transportation problem i

Dl or o2 From O, o4

D2

D3

Available

D4

9t296910 737755 659t2311 68112210

5

6 2 9

Req

5.

Attempt any two ofthe following

:

(10x2:20)

(a) Characteristics of Non-linear programmin g. (b) Algorithm or program for solving L.P.P. using graphical method.

(c)

Principle of optimality in dynamic programming.

MCA315/DLf44181

1900

Suggest Documents