SRI SHANMUGHA COLLEGE OF ENGINEERING AND TECHNOLOGY

(An Autonomous Institution)

[Approved by AICTE, Affiliated to Anna University and Accredited by NAAC & NBA (CSE, ECE & MECH)]
Pullipalayam, Morur (Post), Sankari (Tk), Salem (Dt) – 637 304
Website: www.shanmugha.edu.in Contact Number: 04283-262901
IV-AIDS_GROUP –C ( ASSIGNMENT – 2)
YEAR / SEM : IV / VII Academic Year : 2024-2025
BRANCH : AIDS Batch: 2021-2025
COURSE CODE / COURSE NAME: OIE352 / RESOURCE MANAGEMENT TECHNIQUES

S.No. Register Number Name

1 732721243033 Muhammed Fadal P

2 732721243036 Prabhu S

3 732721243038 Roshan AK

4 732721243040 Sangameswaran P

5 732721243041 Santhosh P

6 732721243042 Saranya V

7 732721243043 Senthilnathan Selvarajan

8 732721243044 Shalini M

9 732721243045 Sharique M

10 732721243047 Sofiya Sree S

11 732721243048 Sowndharrajan M

12 732721243056 Vikram M

13 732721243058 Vimalkumar R

14 732721243059 Yaswanth K
COURSE CODE / COURSE NAME: OIE352 / RESOURCE MANAGEMENT TECHNIQUES
IV-AIDS_GROUP – C (ASSIGNMENT – 2)
PART –A
1. What is cutting plane method?
2. What is dynamic programming?
3. Write down the necessary condition for general nonlinear programming problem
by Lagrange’s multiplier method for equal constraints.
4. What is the role of Lagrangian multiplier in constrained optimization?
5. What is Tucker Condition? And bring out its application
6. What is Newton – Raphson method?
7. Define critical path.
8. Define Pessimistic time estimate in PERT
9. Write difference between CPM and PERT.
10. Point out the uses of GANTT chart.

PART –B
1. Use Branch and Bound technique to solve following:
Maximize Z  2 x1  2 x2
subject to 5 x1  3x2  8; x1  2 x2  4; x1 , x2  0 and int egers
.
2. Solve the following problem by using the method of Lagrangian multipliers.

Minimize Z  x12  x22  x32

subject to g1  x   x1  x2  3x3  2  0;
g 2  x   5 x1  2 x2  x3  5  0 where x1 , x2 , x3  0

3. Solve the non-linear programming problem :

Optimize Z  4 x12  2 x22  x32  4 x1 x2

subject to
x1  x2  x3  25; 2 x1  x2  2 x3  15, where x1 , x2 , x3  0

4. Solve the following non-linear programming problem using K-T conditions.

Minimize Z  x12  2 x22  3 x32

subject to x1  x2  2 x3  12;
x1  2 x2  3x3  8, where x1 , x2 , x3  0

5. Solve the following non-linear programming problem using K-T conditions.

Maximize Z  7 x12  6 x1  5 x22

subject to x1  2 x2  10; x1  3x2  9 where x1 , x2  0

6. Solve f  x   x4  6 x2  4 x  5 by Newton Raphson method

7. Calculate the total float, free float and independent float for the project whose activities
are given below:
Activity 1-2 1-3 2-4 3-4 3-5 4-5 4-6 5-6
Duration (weeks) 6 5 10 3 4 6 2 9
 8. Draw the project network and find the critical path and the corresponding project
completion time. Also, find the total float as well as free float for each of the non-
critical activities.
Activity A B C D E F G H I J
Immediate
- - A,B A,B B C D F,G F,G E,H
Predecessors
Duration (weeks) 4 3 2 5 6 4 3 7 4 2
9. Construct the network for the project whose activities and the three time estimates of these
activities (in weeks) are given below:
(1)Construct the project network (2) Find the expected duration and variance of each activity
(3) Find the critical path and the expected project completion time
(4) What is the probability of completing the project on or before 35 weeks?

Activity A B C D E F G H I J K L M N
Immediate
- - - A A A B,C C D E,G F, H F, H I, J, K L
Predecessors
t0 4 1 2 1 1 1 1 4 2 6 2 5 1 6
tm 4 2 5 4 2 5 2 4 2 7 2 5 2 7
tp 10 9 14 7 3 9 9 4 8 8 8 5 9 8

10. Construct the network for the project whose activities and the three time estimates of these
activities (in weeks) are given below:
(i)Construct the project network (ii) Find the expected duration and variance of each activity

(iii) Find the critical path and the expected project completion time
iv) What is the probability of completing the project on or before 30 weeks?

Activity A B C D E F G H
Predecessors - - A B A C, D C, D, E F
a 3 6 4 3 4 5 3 1
m 5 7 5 5 6 8 6 2
b 8 9 9 8 9 11 9 9

11. The following table indicates the details of a project. The durations are in days. ‘a’
refers to optimistic time, ‘m’ refers to most likely time and ‘b’ refers to pessimistic
time duration.
Activity 1-2 2-3 2-4 3-5 4-5 4-6 5-7 6-7 7-8 7-9 8-10 9-10
t0 3 1 2 3 1 3 4 6 2 1 4 3
tm 4 2 3 4 3 5 5 7 4 2 6 5
tp 5 3 4 5 5 7 6 8 6 3 8 7

(i)Draw the network (ii) Find the critical path

(iii) Determine the expected standard deviation of the completion time.

**********All the Best **********