Resource Management Techniques Exam Paper
Uploaded by
Trishla BhandariTopics covered
- Newton Raphson method,
- salespersons,
- computational techniques,
- project duration,
- Simplex method,
- constraint satisfaction,
- project completion time,
- optimization techniques,
- resource allocation,
- profit constraints
Resource Management Techniques Exam Paper
Uploaded by
Trishla BhandariTopics covered
- Newton Raphson method,
- salespersons,
- computational techniques,
- project duration,
- Simplex method,
- constraint satisfaction,
- project completion time,
- optimization techniques,
- resource allocation,
- profit constraints
*X20411* Reg. No.
Question Paper Code : X 20411
B.E./B.Tech. Degree Examinations, november/december 2020
Seventh Semester
Computer Science and Engineering
cs 6704 – resource management techniques
(Regulations 2013)
Time : Three Hours Maximum : 100 Marks
Std. Statistics table permitted
Answer all questions
Part – A (10×2=20 Marks)
1. What is linear programming ?
2. What is meant by optimal solution of LPP ?
3. Define primal and dual problem.
4. Write the difference between the transportation problem and the assignment
problem.
5. Write the ILP algorithms based on exploiting the tremendous computational
success of Linear Programming.
6. Define Dynamic Programming.
7. What is Newton Raphson method ?
8. Define Kuhn – Tucker conditions.
9. If there are five activities P, Q, R, S and T such that P, Q, R have no immediate
predecessors but S and T have immediate predecessors P, Q and R respectively.
Represent this situation by a network.
10. Define critical path.
X 20411 -2- *X20411*
Part – B (5×13=65 Marks)
11. a) Solve the LPP using graphical method.
Maximize Z = 3x1 + 4x2
Subject to the constraints
2x1 + 5x2 ≤ 120
4x1 + 2x2 ≤ 80
and x1, x2 ≥ 0
(OR)
b) Solve the following LPP using Simplex method.
Max Z = 2x1 + x2+ x3
Subject to
4x1 + 6x2 + 3x3 ≤ 8
3x1 – 6x2 – 4x3 ≤ 1
2x1 + 3x2 – 5x3 ≥ 4
and x1, x2, x3 ≥ 0
12. a) Use dual simplex method to solve the LPP.
Maximize Z = – 3x1 – 2x2
Subject to x1 + x2 ≥ 1
x1 + x2 ≤ 7
x1 + 2x2 ≥ 10
x2 ≤ 3
and x1, x2 ≥ 0
(OR)
b) Consider the problem of assigning four sales persons to four different sales
regions as shown in the following table such that the total sales is maximized.
Sales region
1 2 3 4
1 10 22 12 14
Salesman 2 16 18 22 10
3 24 20 12 18
4 16 14 24 20
The cell entries represent annual sales figures in lakhs of rupees. Find the
optional allocation of the sales persons to different regions.
*X20411* -3- X 20411
13. a) Find the optimum integer solution to the following linear programming problem :
Maximize z = x1 + 2x2
Subject to
2x2 ≤ 7
x1 + x2 ≤ 7
2x1 = 11
and x1, x2 ≥ 0 and are integers.
(OR)
b) Use Branch and Bound method to solve the following :
Maximize z = 2x1 + 2x2
Subject to
5x1+ 3x2 ≤ 8
x1 + 2x2 ≤ 4
and x1, x2 ≥ 0 and integers.
14. a) Solve 2x3 – 2.5x – 5 = 0 for the root in [1, 2] by Newton Raphson method.
(OR)
b) Minimize f = x12 + 2x 22 + 3x32
Subject to the constraints :
g1= x1– x2 – 2x3 ≤ 12
g2= x1+ 2x2 – 3x3 ≤ 8
Using Kuhn-Tucker conditions.
15. a) Draw the network from the following activity and find the critical path and
total duration of project.
Activity Immediate Predecessors Duration (Weeks)
A – 3
B – 8
C A 9
D B 6
E C 10
F C 14
G C, D 11
H F, G 10
I E 5
J I 4
K H 1
(OR)
X 20411 -4- *X20411*
b) A project has the following activities and other characteristics :
Time estimate (in weeks)
Activity Preceding Most Most Most
Activity Optimistic Likely Pessimistic
A – 4 7 16
B – 1 5 15
C A 6 12 30
D A 2 5 8
E C 5 11 17
F D 3 6 15
G B 3 9 27
H E, F 1 4 7
I G 4 19 28
Required :
i) Draw the PERT network diagram.
ii) Identify the critical path.
iii) Prepare the activity schedule for the project.
iv) Determine the mean project completion time.
v) Find the probability that the project is completed in 36 weeks.
Part – C (1×15=15 Marks)
16. a) Unit profit of five salesmen in four places are given below.
S1 S2 S3 S4 S5 Available
P1 5 6 4 2 6 40
P2 7 9 5 2 5 50
P3 3 3 3 2 4 60
P4 7 8 5 4 4 50
Demand 40 30 40 40 30
Solve the problem to maximize the profit.
(OR)
b) Solve the integer programming problem.
Maximize Z = 80x1 + 45x2
Subject to
x1 + x2 < 7
12x1 + 5x2 < 60
and x1, x2 > 0 and integer.
–––––––––––––
