M.C.A. DEGREE EXAMINATION, APRIL 2016
Mathematics
Elective — RESOURCE MANAGEMENT TECHNIQUES
(2012 onwards)
(Common for M.C.A.
Time 3 Hours Maximum 75 Marks
Part A (10 2 20)
Answer all questions.
1. How will you overcome degeneracy in transportation
problem?
2. What are the methods to use for solving an integer
programming problem?
3. Explain the term in PERT: Three time estimates?
4. What are the characteristic of LPP?
5. What is Branch and Bound Technique?
6. What is the purpose of Fractional cut constraints?
7. What are the advantages of CPM and PERT techniques?
8. Define total float and free float.
9. List any two applications of Queuing theory.
10. Explain the terms 'jockeying' and reneging' in queuing
models.
Sub. Code
541560/
545560
RW-10964
2
Wk ser
Part B 5 25)
Answer all questions.
11. Use simplex method to solve the LPP
Maximize Z 3x1 5x2
Subject to the constraints
0 6.
0 4
3 2 18
1
1
1 2



x
x
x x
Or
Use a Two-Phase simplex method to
Maximize Z 3x1 2x2
Subject to the constraints
0.
3 4 12
2 2
1 2
1 2
1 2



x x
x x
x x
12. Solve the following assignment problem
I II III IV V
A 10 5 9 18 11
B 13 19 6 12 14
C 3 2 4 4 5
D 18 9 12 17 15
E 11 6 14 19 10
Or
Write in detail about the Transportation problem
with an example.
RW-10964
3
Wk ser
13. What are the methods to use for solving an integer
programming problem?
Or
Solve the following all-Integer programming
problem using the branch and bound method.
Minimize Z 3x1 2.5x2
Subject to the constraints
3 2 50.
2 20
1 2
1 2


x x
x x
14. Discuss the different phases of Project scheduling.
Or
Explain the function of Probability and Cost
consideration in Project scheduling.
15. Explain about ABC analysis in detail.
Or
Explain in detail about the Queuing theory.
Part C 10 30)
Answer any three questions.
16. Solve the given linear programming problem using
simplex algorithm method
Maximize Z 4x1 5x2
Subject to
unrestricted, 0.
4 4 10
2 3 8
1 2
1 2
1 2



x x
x x
x x
RW-10964
4
Wk ser
17. Solve the following problem using Gomory's cutting plane
method.
Maximize f 6x1 7x2
Subject to
4
5 9 45
7 6 42
1 2
1 2
1 2



x x
x x
x x
xi 0 and integer, i 1,2 .
18. Solve the following integer programming problem using
Branch and Bound technique
Maximize z 10x 20y
Subject to
0 and integers.
3 23
6 8 48



x y
x y
x y
19. Discuss the types of float in CPM and bring out the
difference between PERT and CPM.
20. What is Inventory Management and how EOQ is
maintained with uniform demand and shortages?