Anna University Chennai 2007 M.C.A RESOURCE MANAGEMENT TECHNIQUE - Question Paper

(ii) Write any 3 advantage and Limitations of Linear
Programming. (6)

Or

(b) Solve the subsequent using Simplex method
Maximize 15x1+6x2+9x3+2x4.

2x1+x2+5x3+6x4 = 20
3x1 +x2+3x3+25x4 = 24
7x1+x4 = 70
and x1,x2 ,x3,x4= 0.

12. (a) Solve the subsequent transportation issue to maximize profit. (16)

A B C D Supply
one 40 25 22 33 4
two 44 35 30 30 30
three 38 38 28 30 70
Demand 40 20 60 30


Or

(b) (i) A company has 4 machine to do 3 jobs.Each job can be
assigned to 1 and only machine.The cost of every job on every
machine is provided in the subsequent table.

one two three four
A 18 24 28 32
B eight 13 17 19
C 10 15 19 22
elaborate th jobs assignments which will minimize the cost. (10)


(ii) Write a algorithm for Hungarian Method. (6)

12. (a) Solve the subsequent mixed integer programming
Max Z=x1+x2
Subject to constraints

2x1+5x2 = 16
6x1+5x2 = 30
and x2 = 0 and x1 non negative integer. (16)

Earning:   Approval pending.