Anna University Chennai 2007 M.C.A RESOURCE MANAGEMENT TECHNIQUE - Question Paper
Monday, 04 March 2013 01:15Web
Page 1 of 3
M.C.A DEGREE EXAMINATION,NOVEMBER/DECEMBER 2007
Fourth Semester
MC 1725-RESOURCE MANAGEMENT TECHNIQUES
(REGULATION 2005)
Time:THREE HOURS Maximum:100 marks
ans ALL ques.
PART A-(10 x 2=20 marks)
1. A firm manufacture 2 kinds of product A and B and sels them at a profit
of Rs.2 on kind A and Rs.3 on kind B.Each product is processed on two
machines M1 and M2.Type A requires one minute of processing time on
M1 and two minutes on M2 kind B requires one minute on Mi and one minute
On M2. Machine M1 is available for not more than six hours 40 minutes
while machine M2 is available for 10 hours during any working day.
Formulate the issue as a LPP so as to maximize the profit.
2. describe Feasible solution and Optimal solution.
3. Determine basic feasible solution to the subsequent transportation
issue using North West corner Rule.
A B C D E Supply
P two 11 10 three seven 4
Q one four seven two one 8
R three nine four eight 12 9
Demand three three four five 6
4. Difference ranging from the transportation issue and the assignmaent issue.
5. List the different typ[es of Integer programming issue.
6. Write any 4 applications of Integer programming.
7. Construct the network for the project whose precedence
Relationships are as provided beneath.
B < E, F ; C < G, L;E ,G < H;L , H
8. What is Independent float?
9. In a railway marshalling yard , goods train arrive at a rate of 30 Trains
Per day.Assuming that inter arrival time follows an exponential distribution
And the service time distribution is also exponential with an avg. of
36 minutes.Calculate the mean queue size and the probability that queue
size exceeds 10.
10. describe queueing system.
PART B-(5 x 16=80 marks)
11.(a) (i) Solve the LPP graphically
Maximize Z=100x1+40x2.
Subject to 5x1+2x2 = 1000
3x1 +2x2 = 900
x1+2x2 = 500
and x1,x2 = 0. (10)
| Earning: Approval pending. |
