PRATHYUSHA ENGINEERING COLLEGE

2019 – 20 Odd Semester

IMPORTANT QUESTIONS & ANSWERS
Department of Computer Science and Engineering

SUBJECT CODE: CS6704

SUBJECT NAME: RESOURCE MANAGEMENT TECHNIQUES

Regulation: 2013 Semester and Year: 07 & IV

Dr. M. GOPIKRISHNAN
PROFESSOR
Department of Computer Science and
Engineering
 ANNA UNIVERSITY, CHENNAI-25
SYLLABUS COPY
REGULATION 2013
CS6704 RESOURCE MANAGEMENT TECHNIQUES LTPC 3 00 3
OBJECTIVES:
The student should be made to:
 Be familiar with resource management techniques.
 Learn to solve problems in linear programming and Integer programming.
 Be exposed to CPM and PERT.
UNIT I LINEAR PROGRAMMING 9
Principal components of decision problem – Modeling phases – LP Formulation and graphic
solution – Resource allocation problems – Simplex method – Sensitivity analysis.

UNIT II DUALITY AND NETWORKS 9

Definition of dual problem – Primal – Dual relationships – Dual simplex methods – Post
optimality analysis – Transportation and assignment model - Shortest route problem.

UNIT III INTEGER PROGRAMMING 9

Cutting plan algorithm – Branch and bound methods, Multistage (Dynamic) programming.

UNIT IV CLASSICAL OPTIMISATION THEORY 9

Unconstrained external problems, Newton – Ralphson method – Equality constraints –
Jacobean methods – Lagrangian method – Kuhn – Tucker conditions – Simple problems.
UNIT V OBJECT SCHEDULING 9
Network diagram representation – Critical path method – Time charts and resource levelling –
PERT.TOTAL: 45 PERIODS
OUTCOMES:
Upon Completion of the course, the students should be able to:
 Solve optimization problems using simplex method.
 Apply integer programming and linear programming to solve real-life applications.
 Use PERT and CPM for problems in project management
TEXT BOOK:
1. H.A. Taha, “Operation Research”, Prentice Hall of India, 2002.
REFERENCES:
1. Paneer Selvam, „Operations Research‟, Prentice Hall of India, 2002
2. Anderson „Quantitative Methods for Business‟, 8th Edition, Thomson Learning, 2002.
3. Winston „Operation Research‟, Thomson Learning, 2003.
4. Vohra, „Quantitative Techniques in Management‟, Tata Mc Graw Hill, 2002.
5. Anand Sarma, „Operation Research‟, Himalaya Publishing House, 2003.
 TABLE OF CONTENTS
PAGE
S. NO TOPIC
NO
a Aim and Objective of the subject 1
b Detailed Lesson Plan 2
c Part A UNIT I 5
d Part B UNIT I 9
1. Linear Programming Formulation 13
2. Graphical Method 20
3. Simplex Method 38
e Part A UNIT II 54
f Part B UNIT II 59
4. Dual Problem – Introduction 59
5. Dual Simplex Method 67
6. Transportation Model 78
7. Assignment Problem 109
8. Shortest Route Problem 128
9. Post Optimality Analysis 132
g Part A UNIT III 135
h Part B UNIT III 140
10. Gomory‟s Mixed Integer Method 156
11. Branch and Bound Method 164
i Part A UNIT IV 171
j Part B UNIT IV 173
12. Newton Raphson Method 173
13. Jacobian Method 177
14. Lagrangean Method 181
15. Kuhn-Tucker Method 190
k Part A UNIT V 196
l Part B UNIT V 200
16. Object Scheduling - CPM 200
17. PERT 203
18. Crashing 208
19. Resource Levelling 212
20. Previous Year Question Papers 217
 AIM AND OBJECTIVE OF THE SUBJECT

 Be familiar with resource management techniques.

 Learn to solve problems in linear programming and Integer programming.
 Be exposed to CPM and PERT.
 To understand decision making for Resource allocation with the Linear
Programming techniques.
 To know the various shortest path methods in duality and networks related
problems.
 To understand the integer programming techniques.
 To know about the classical optimization theory and its techniques.
 To know the various Object Scheduling methods.

1
 DETAILED LESSON PLAN
TEXT BOOK:
1. H.A. Taha, “Operation Research”, Prentice Hall of India, 2002.
REFERENCES:
1. Paneer Selvam, „Operations Research‟, Prentice Hall of India, 2002
2. Anderson „Quantitative Methods for Business‟, 8th Edition, Thomson Learning,
2002.
3. Winston „Operation Research‟, Thomson Learning, 2003.
4. Vohra, „Quantitative Techniques in Management‟, Tata Mc Graw Hill, 2002.
5. Anand Sarma, „Operation Research‟, Himalaya Publishing House, 2003.

Hours
Cumulative Books
Sl. No Unit Topic / Portions to be Covered Required /
Hrs Referred
Planned
UNIT I - LINEAR PROGRAMMING
1 1 Linear Programming - Introduction 1 1 TB1
Principal components of decision
2 1 1 2 TB1
problem
3 1 Modeling phases 1 3 TB1

4 1 LP Formulation and graphic solution 1 4 TB1

5 1 Resource allocation problems 1 5 TB1

6 1 Simplex method 1 6 TB1

7 1 Sensitivity analysis 1 7 TB1

UNIT II - DUALITY AND NETWORKS

8 2 Duality And Networks - Introduction 1 8 RB1

9 2 Definition of dual problem 1 9 TB1

10 2 Definition of dual problem 1 10 TB1

11 2 Primal 1 11 TB1

12 2 Dual relationships 1 12 RB1

2
 Hours
Cumulative Books
Sl. No Unit Topic / Portions to be Covered Required /
Hrs Referred
Planned

13 2 Dual simplex methods 1 13 TB1

14 2 Post optimality analysis 1 14 TB1

15 2 Transportation Model 1 15 TB1

16 2 Assignment model 1 16 TB1

17 2 Shortest route problem 1 17 TB1

UNIT III - INTEGER PROGRAMMING

18 3 Integer Programming - Introduction 1 18 TB1

19 3 Cutting plan algorithm 1 19 TB1

20 3 Cutting plan algorithm 1 20 TB1

21 3 Branch and bound methods 1 21 RB1

22 3 Branch and bound methods 1 22 RB1

23 3 Branch and bound methods 1 23 TB1

24 3 Branch and bound methods 1 24 TB1

25 3 Multistage (Dynamic) programming 1 25 TB1

26 3 Multistage (Dynamic) programming 1 26 TB1

27 3 Multistage (Dynamic) programming 1 27 TB1

UNIT IV - CLASSICAL OPTIMISATION THEORY

Classical Optimisation Theory -
28 4 1 28 TB1
Introduction
29 4 Unconstrained external problems 1 29 TB1

30 4 Ralphson method 1 30 RB1

3
 Hours
Cumulative Books
Sl. No Unit Topic / Portions to be Covered Required /
Hrs Referred
Planned

31 4 Equality constraints 1 31 RB1

32 4 Jacobean methods 1 32 RB1

33 4 Lagrangian method 1 33 RB1

34 Kuhn 1 34 TB1
4
35 4 Tucker conditions 1 35 TB1

36 4 Simple problems 1 36 TB1

UNIT V - OBJECT SCHEDULING
37 5 Network diagram representation 2 38 TB1

38 5 Critical path method 2 40 RB1

39 5 Time charts and Resource Levelling 2 42 RB1

40 5 PERT 1 43 TB1

41 5 Crashing in PERT 2 45 TB1

4
 UNIT-I – LINEAR PROGRAMMING
Principal components of decision problem – Modeling phases – LP Formulation and
graphic solution – Resource allocation problems – Simplex method – Sensitivity
analysis.

PART-A
1. What is linear programming?
Linear programming is a technique used for determining optimum utilization of
limited resources to meet out the given objectives. The objective is to maximize the profit
or minimize the resources(men, machine, materials and money).

2.What are the characteristics of Standard form of LPP?

 The objective function is to maximization type.
 All the constraint equation must be equal type by adding slack or surplus
variables.
 RHS of the constraint equation must be positive type.
 All the decision variables are of positive type

3. A firm manufactures two types of product A and B and sells them at profit of Rs2
on type A and Rs3 on type B. Each products is processed on two machines M1 and
M2.Type A requires 1 minute of processing time onM1 and 2 minutes on M2 Type
B requires 1 minute of processing time on M1 and 1 minute on M2.Machine M1 is
available for not more than 6 hours 40 minutes while machine M2 is available for
10 hours during working day. Formulate the problem as a LPP so as to maximize
the profit.
Maximize z= 2 x1+3x2.
Subject to the constraints:
x1+x2 <=400
2x1+x2<=600
x1,x2 >=0

5
4. Define feasible solution.
Any Solution to a LPP which satisfies the non negativity restrictions of LPP‟s
called the feasible solution.

5. Define optimal solution of LPP.

Any feasible solution which optimizes the objective function of the LPP‟s called
the optimal solution.

6. State the applications of linear programming.

 Work scheduling
 Production planning and production process
 Capital budgeting
 Financial planning
 Blending
 Farm planning
 Distribution

7. State the limitations of LP.

 LP treats all functional relations as linear.
 LP does not take into account the effect of time and uncertainty
 No guarantee for integer solution. Rounding off may not feasible or optimal
solution
 Deals with single objective, while in real life the situation may be difficult.

8. What is slack variable?

If the constraint as general LPP be <= type then a non negative variable is introduced
convert the inequalities into equalities are called slack variables. The values of these
variable are interpreted as the amount of unused resources.

6
9.Define basic solution.
Given a system of m linear equations with n variables(m<n).The solution obtained
by setting(n-m) variables equal to zero and solving for the remaining m variables is called
abasic solution.

10.Define basic variable and non-basic variable in linear programming.

A basic solution to the set of constraints is a solution obtained by setting any n
variables equal to zero and solving for remaining m variables not equal to zero. Such m
variables are called basic variables and remaining n zero variables are called non-basic
variables.

11.Define surplus variable.

If the constraint as general LPP be >=type then a non negative is introduced to
convert the inequalities into equalities are called the surplus variables.

12. Write the standard form of LPP in the matrix solution.

Maximize Z=CX(objective function)
Subject to AX <=b(constraints) and X>=0(non negative restrictions)
Where C=(C1,C2,…Cn)
A= a11…….a12…….a1n
a21…….a22…….a2n
.
.
am1……am2……amn
X=x1 b=b1
x2 b2
. .
. .
xn bn

7
13. What is sensitivity analysis? What does it signify? What is the purpose of
sensitivity analysis?
After formulating mathematic model to linear programming problems and then
attaining the optimal solution of the problem, it may be required to study the effect of
changes in the different parameters of the problem,on the optimum solution, that is it may
be desirable to see the sensitiveness of the feasible optimal solution corresponding to the
variations in the parameters. The investigations that deal with changes in the optimal
solutions due to discrete variations in the parameters aij,bj and cj are called sensitivity
analysis.The purpose of sensitivity analysis is to find, how to preserve , to a minimum
,the additional computational efforts which arise in solving the problem as a new one.

14.What do you understand by degeneracy?

The concept of obtaining a degenerate basic feasible solution in LPP is known as
degeneracy. This may occur in the initial stage when atleast one basic variable is zero in
the initial basic feasible solution

8
PART B

9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
 UNIT-II – DUALITY AND NETWORKS

Definition of dual problem – Primal – Dual relationships – Dual simplex methods –

Post optimality analysis – Transportation and assignment model - Shortest route
problem.

PART-A
1.What are the methods used in transportation problem to obtain the initial basic
feasible solution.
 North-west corner rule
 Lowest cost entry method
 Vogel‟s approximation method.

2. What is balanced transportation problem and unbalanced transportation

problem?
 When the sum of supply is equal to demands, then the problem is said to be
balanced transportation problem.
 When the sum of supply is not equal to demands, then the problem is said to be
unbalanced transportation problem.

3. Define unbounded assignment problem and describe the steps involved in solving
it?
If the number of rows is not equal to the number of column in the given cost
matrix the problem is said to be unbalanced. It is converted to a balanced one by adding
the dummy row or dummy column with zero cost.

4.What is a travelling salesman problem?

A salesman normally must visit a number of cities starting from his head quarters.
The distance between every pair of cities are assumed to be known. The problem of
54
finding the shortest distance if the salesman starts from his head quarters and passes
through each city exactly once and returns to the headquarters is called Travelling
salesman problem.

5. Give two areas of operation of assignment problem.

 Assigning jobs to machines
 Allocating men to jobs/machines
 Route scheduling for a travelling salesman

6. Distinguish between transportation model and assignment model

Transportation problems Assignment problems
Supply at any source may be any positive Supply at any source will be 1
quantity
Demand at any destination maybe a Demand at any destination will be 1
positive quantity
One or more source to any number of One source one destination.
destination

7. Explain the steps in the Hungarian method used for solving assignment problems.
Step1: Subtract the smallest cost element of each row from all the elements in the
row of the given cost matrix.
Step2: Subtract the smallest cost element of each column from all the elements in
the column of the resulting cost matrix obtained by step1.
Step3:Assigning zeros
Step4:Apply optimal test
Step5:Cover all the zeros by drawing a minimum number of straight lines.
Step 6: Determine the smallest cost element not covered by the straight
lines.Subtract this smallest cost element from all the uncovered elements and add

55
 this to all those element which are lying in the intersection of these straight lines
and do not change the remaining elements which lie on the straight lines.
Step 7: Repeat step (1) to (6),until optimum assignment is attained.

8. Give the mathematical formulation of assignment problem.

The assignment model is then given by the following LPP
𝑛 𝑛
Minimize Z= 𝑖=1 𝑗 =1 𝑐𝑖𝑗 𝑥𝑖𝑗
Subject to the constraints
𝑛
𝑖=1 𝑥𝑖𝑗 =1,j=1,2…n
𝑛
𝑗 =1 𝑥𝑖𝑗 =1,i=1,2…n

And 𝑥𝑖𝑗 =0 or 1.

9. What is the purpose of MODI method?

Modified Distribution Method is the optimization technique used to find optimal
transportation method. In MODI method,we modify our existing initial basic feasible
solution through series of optimality tests to find the optimal solution.

10. What is a dual problem in linear programming?

For every linear programming problem there is a unique linear programming
problem associated with it, involving the same data and closely related optima solutions.
The original problem then called primal solution where the other is called its dual
problem . In general , the two problems are said to be duals of each other.

11. State the fundamentality theorem of duality

Dual to an LP in standard form
(P) m aximize c T x
subject to Ax ≤ b, 0 ≤ x
is the LP

56
 (D) minimize b T y
subject to AT y ≥ c, 0 ≤ y.

12. Explain the primal-dual relationship.

x1 x2 x3 … xn
y1 a11 a12 a13 … a1n <= b1 R.H.S
Dual y2 a21 a22 a23 … a2n <= b2 Of
Variabl … … primal
es ym am1 am am3 … amn <= bm consta
2 rints
>= >= >= …. >=
c1 c2 c3 …. cn
RH.S of dual constraints
Minimize W=bTY
Subject to the constraints ATY >= CT
And Y >= 0

13. What is the difference between regular simplex method and dual simplex
method?
 The Simplex method will be the basic technique, exactly where linear
programming techniques are usually derived. Within dual simplex the first
schedule will be primal infeasible, due to the fact some all RHS tend to be non
positive.
 In simplex method our aim is to find optimality condition using feasibility
condition.But in dual method we are trying to achieve feasibility condition using
optimality condition.

57
14. What do you mean by shadow prices?
Shadow prices are the estimated price of a good or service for which no market
price exists.

15. Write down the symmetric form of dual problem.

Maximize Z=c1x1+ c2x2+ c3x3+…. cnxn
Subject to the constraints
a11x1+ a12x2+…+ a1nxn <= b1
a21x1+ a22x2+…+ a2nxn <= b2
……………………………..
am1x1+ am2x2+…+ amnxn <= bm
and x1+ x2+………..+ xn >=0
ie., Max Z =CX
subject to AX <= b
and X >= 0

58
PART-B

59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
 UNIT-III – INTEGER PROGRAMMING
Cutting plan algorithm – Branch and bound methods, Multistage (Dynamic)
programming.

PART A
1. What is integer programming? What are the types?
A linear programming problem in which some or all of the variables in the optimal
solution are restricted to assume non-negative integer values is called an integer
programming problem or integer linear programming.
Types : Mixed IPP,Pure IPP

2.Differentiate between pure and mixed programming problems.

 In a linear programming problem, if all the variables in the optimal solution are
restricted to assume nonnegative integer values,then it is called the pure(all)
integer programming problem.
 In a linear programming problem, if only some of the variables in the optimal
solution are restricted to assume non-negative integer values, while the remaining
variables are free to take any nonnegative values,then it is called mixed
programming problems

3. Give any two applications of integer programming.

 All transportation, assignment and travelling salesman problems are integer
programming problems, since the decision variables are either 0 or 1.
 All sequencing and routing decisions problems are integer programming problems,
as it requires the integer values of the decision variables.
 Integer programming problems occur quite frequently in business and industry.

135
 𝟐
4. Write down the Gomory’s fractional cut corresponding to the equation 𝐱 𝟏 + 𝟑 𝐱 𝟑 −
𝟏 −𝟐
x = That appears in the non-integer optimal simplex table of an integer
𝟑 4 𝟑

programming problem.
−2 2 −2
x3 − x4 + s1 =
3 3 3

5. What is search method?(Branch and Bound Technique)

It is an enumeration method in which all feasible integer points are enumerated. The
widely used search method is the Branch and Bound Technique. It also starts with the
continuous optimum, but systematically partitions the solution space into sub problems
that eliminate parts that contain no feasible integer solution. It was originally developed
by A.H.Land and A.G.Doig.

6. What is dynamic programming?

Dynamic programming is a mathematical technique of optimization using multi-
stage decision process.The dynamic programming technique decomposes the original
problem in n-variables in to n-sub problems(stages) each in one variable.The solution is
obtained in an orderly manner by starting from one stage to the next and is completed
after the final stage is reached.

7.State Bellman’s principle of optimality

An optimal policy(set of decisions) has the property that whatever be the initial
state and initial decisions, the remaining decisions must constitute an optimal policy for
the state resulting from the first decisions.

8. State the application of the principle of optimality in dynamic programming.

 In the population area, this technique has been used for production, scheduling and
employment smoothening problems.

136
  It is used to determine the optimal combination of advertising media (TV, Radio,
Newspapers) and frequency of advertising.
 It can be used in replacement theory to determine at which age the equipment is to be
replaced for optimal return from the facilities.
 Spare part level determination to guarantee high efficiency utilization of expensive
equipment.

9. State any two merits of dynamic programming techniques.

Dynamic programming enables you to develop sub solutions of a large program. The
sub solutions are easier to maintain,use and debug. And they possess overlapping also that
means we can reuse them, these sub solutions are optimal solutions for the problem.

10. What is Zero-one problem?

If all the variables in the optimum solution are allowed to take values either 0 or 1 as
in „do‟ or „not to do‟ type decisions, then the problem is called Zero-one problem or
standard discrete programming problem.

11. Why not round off the optimum values instead of resorting to IP? (MAY ’08)
There is no guarantee that the integer valued solution (obtained by simplex method)
will satisfy the constraints. i.e. ., it may not satisfy one or more constraints and as such
the new solution may not feasible. So there is a need for developing a systematic and
efficient algorithm for obtaining the exact optimum integer solution to an IPP.

12.What are methods for IPP? (MAY ’08)

Integer programming can be categorized as
(i) Cutting methods
(ii) Search Methods.

137
13. What is cutting method?
A systematic procedure for solving pure IPP was first developed by R.E.Gomory
in 1958. Later on, he extended the procedure to solve mixed IPP, named as cutting plane
algorithm, the method consists in first solving the IPP as ordinary LPP.By ignoring the
integrity restriction and then introducing additional constraints one after the other to cut
certain part of the solution space until an integral solution is obtained.

14. Give the general format of IPP?

The general IPP is given by Maximize Z = CX
Subject to the constraints AX ≤ b,
X ≥ 0 and some or all variables are integer.

15. Write an algorithm for Gomory’s Fractional Cut algorithm?

1.Convert the minimization IPP into an equivalent maximization IPP and all the
coefficients and constraints should be integers.
2. Find the optimum solution of the resulting maximization LPP by using simplex
method.
3.Test the integrity of the optimum solution.
4.Rewrite each XBi
5. Express each of the negative fractions if any, in the kth row of the optimum
simplex
table as the sum of a negative integer and a non-negative fraction.
6.Find the fractional cut constraint
7. Add the fractional cut constraint at the bottom of optimum simplex table
obtained in
step 2.
8. Go to step 3 and repeat the procedure until an optimum integer solution is
obtained.

138
16. A manufacturer of baby dolls makes two types of dolls, doll X and doll Y.
Processing of these dolls is done on two machines A and B. Doll X requires 2 hours
on machine A and 6 hours on Machine B. Doll Y requires 5 hours on machine A and
5 hours on Machine B. There are 16 hours of time per day available on machine A
and 30 hours on machine B. The profit is gained on both the dolls is same. Format
this as IPP?
Let the manufacturer decide to manufacture x1 the number of doll X
and x2 number of doll Y so as to maximize the profit. The complete
formulation of the IPP is given by
Maximize Z = x1+x2
Subject to 2 x1 + 5 x2 ≤16
6 x1+ 5 x2 ≤30
and ≥0 and are integers.

139
PART-B

140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
 UNIT-IV – CLASSICAL OPTIMISATION THEORY

Unconstrained external problems, Newton – Ralphson method – Equality constraints

– Jacobean methods – Lagrangian method – Kuhn – Tucker conditions – Simple
problems.

PART-A
1. Write down the sufficient condition for the Extrema?
A sufficient condition for a stationary point 𝑋0 to be extremum is that the Hessian
matrix H evaluated at is
i) Positive definite when 𝑋0 is a minimum point.
ii) Negative definite when 𝑋0 is a maximum point

2. Write the Hessian matrix for f ( 𝒙𝟏 , 𝒙𝟐, , 𝒙𝟑 )

𝝏𝟐 𝒇 𝝏𝟐 𝒇 𝝏𝟐 𝒇
𝝏𝒙𝟐𝟏 𝝏𝒙𝟏 𝝏𝒙𝟐 𝝏𝒙𝟏 𝝏𝟑
𝝏𝟐 𝒇 𝝏𝟐 𝒇 𝝏𝟐 𝒇
The Hessian Matrix is
𝝏𝒙𝟐 𝝏𝒙𝟏 𝝏𝒙𝟐𝟐 𝝏𝒙𝟐 𝝏𝒙𝟑
𝝏𝟐 𝒇 𝝏𝟐 𝒇 𝝏𝟐 𝒇
𝝏𝒙𝟑 𝝏𝒙𝟏 𝝏𝒙𝟑 𝝏𝒙𝟐 𝝏𝒙𝟐𝟑

3. State the order of convergence of Newton’s Raphson Method.

The order of convergence of Newton‟s Raphson Method is of order2.

4. Find an iterative formula of Newton’s Raphson method.

𝒇(𝒙𝒏)
Xn+1=xn-
𝒇′ (𝒙𝒏)

5. State the criterion for the Newton’s Raphson method.

The criterion for convergence of Newton‟s Raphson is 𝒇 𝒙 𝒇′′ 𝒙 < |𝒇′ 𝒙 |𝟐

171
6. What is the order of Convergence for fixed point iteration?
The Convergence is linear and the convergence is of order 1.

7. Write the two methods of Equality Constraints.

1. Jacobian Method, 2. Lagrangean Method.

8. Write the method of Inequality Constraints.

Kuhn-Tucker Method.

9. Write down the sufficient condition for Kuhn-Tucker Method.

If the objective function and the solution space satisfy certain conditions regarding
convexity and concavity.

10. Write the constraint gradient vector of f with respect to Z.

𝜕 𝑐 𝑓 𝑌,𝑍
𝛻𝑐 𝑓 = = 𝛻𝑧 𝑓 − 𝛻𝑌 𝑓𝐽−1 𝐶
𝜕𝑐 𝑍

11. Write the necessary conditions for Kuhn tucker method.

a. ∅𝑖 ≥ 0, 𝑖 = 1,2,3 … 𝑚
𝜕𝐿
b. = 0 , 𝑖 = 1,2,3 … 𝑛
𝜕𝑋 𝑖

c.∅𝑖 𝑔𝑖 (X1,X2,…Xn)=0,i=1,2,…m
d. 𝑔𝑖 (X1,X2,…Xn)≤ 0,i=1,2,…m

172
PART B

173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
 UNIT-V – OBJECT SCHEDULING

Network diagram representation – Critical path method – Time charts and resource
levelling – PERT.

PART-A
1. Define project. What are the three main phases of project
A project is defined as a combination of interrelated activities,all of which must be
executed in a certain order to achieve a set of goal.
Phases of project: Planning, Scheduling and Control

3.What are the two basic planning and controlling techniques in a network analysis?
Critical Path Method (CPM)
Programme Evaluation and Review Technique (PERT)

4.What are the advantages of CPM and PERT techniques?

It encourages a logical discipline in planning, scheduling and control of projects
It helps to effect considerable reduction of project times and the cost
It helps better utilization of resources like men, machines, materials and money
with reference to time
It measures the effect of delays on the project and procedural changes on the
overall schedule.

5.What is resource leveling?

Resource leveling attempt to reduce peak resource requirements and smooth out
period to period assignments without changing the constraints on project duration.

6.What is heuristic programming?

Lacking time or inclination to pursue more thorough problem solving procedures, one
employs a rule of thumb arising out of experience, expertise and common sense. In some

196
cases rule of thumb is insufficient. It must be combined with other rules to take into
additional factors or exceptional circumstances. A collection of such rules for solving a
particular problem is called a heuristic program,

7.What are the two main costs for a project? Illustrate with examples.
 Direct costs are the costs directly associated with each activity such as machine
costs, labour costs etc for each activity.
 Indirect costs are the costs due to management services ,rentals, insurance
including allocation of fixed expenses, cost of security etc.

8. What are the three time estimates of PERT?

 Optimistic (least) time estimate:(t0 or a) is the duration of any activity when
everything goes on very well during the project ie., labourers are available and
come in time, machines are working properly, money is available whenever
needed, there is no scarcity of raw material needed etc.
 Pessimistic (greatest) time estimate:(tp or b) is the duration of any activity when
almost everything goes against our will and a lot of difficulties is faced while
doing a project.
 Most likely time estimate :(tm or m) is the duration of any activity when
sometimes things go on very well, sometimes things go on very bad while doing
the project

9. Difference between PERT and CPM.

PERT CPM
1.PERT was developed in a brand new 1.CPM was developed for conventional
R and D project it had to consider and projects like construction project which
deal with uncertain ties associated with consists of well known routine tasks
such projects whose resource requirements and

197
 duration were known with certainty.
2.PERT is usually used for projects in 2.CPM is used for projects involving
which time estimates are uncertain. well known activities of repetitive in
Example: R &D activities which are nature.
usually non-repetitive.
3.Emphasis is given to important stages 3.CPM is suited to establish a trade off
of completion of task rather than the for optimum balancing between
activities required to be performed to schedule time and cost of the project.
reach a particular event or task in the
analysis of network ie.,PERT network
is essentially an event-oriented network.
4.PERT is Probabilistic 4.CPM is Deterministic

10. What is the formula to compute the cost slope for each activity?
Cost slope = (Crash cost-Normal cost)/(Normal duration-Crash duration)

11. What is the crash time?

Crash time is the duration upto which the normal time of an activity can be
shortened by adding extra resources.

12. Define free float, independent float and total float.

Total float of an activity(T.F) is defined as the difference between the latest finish
and the earliest finish of the activity or the difference between the latest start and the
earliest start of the activity.
Free float of an activity is that portion of the total float which can be used for
rescheduling that activity without affecting the succeeding activity
Free float of an activity i-j=(total float of i-j )- Slack of the head event j
Independent float of an activity is the amount of time by which the activity can be
rescheduled without affecting the preceding or succeeding activities of that activity.
198
 I.F=Free float i - j -slack of the tail event i.

13.What is critical paths?

Path connecting the first initial node to the very last terminal node, of longest
duration in any project network is called critical path. All the activities in the critical path
is called critical activities.

14.What is standard deviation and variance in PERT network? (NOV ’07)

The expected time of an activity in actual execution is not completely reliable and is
likely to vary. If the variability is known we can measure the reliability of the expected
time as determined from three estimates. The measure of the variability of possible
activity time is given by standard deviation, their probability distribution Variance of the
activity is the square of the standard deviation

15. Define float or slack? (MAY ’08)

Slack is with respect to an event and float is with respect to an activity. In other
words, slack is used with PERT and float with CPM. Float or slack means extra time over
and above its duration which a non-critical activity can consume without delaying the
project.

199
PART-B

200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
 Question Paper Code: 80307

B.E / B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2016

Seventh Semester
Computer Science & Engineering
CS 6704 – RESOURCE MANAGEMENT TECHNIQUES
(Regulation 2013)
Time: Three Hours Maximum: 100 Marks
Answer ALL Questions
PART A – (10 * 2 = 20 Marks)

1. Define feasible solution and optimal solution to the linear programming

problem. (Pg. No. 6)
2. What do you mean by shadow pricing? (Pg. No. 58)
3. What are the characteristics of a primal and dual problem?
(Pg. No. 56)
4. State the necessary and sufficient condition for a transportation
problem to have a solution. (Pg. No. 54)
5. Mention some important applications of Integer programming problem.
(Pg. No. 135)
6. Write down the methods for solving integer linear programming
problem. (Pg. No. 135)
7. Write down the Lagrangian function for Khun-tucker method for the
following non linear programming with inequality constraints. (Pg. No.
172)
8. Examine f(x) =6x5 - 4x3 + 10 for extreme points. (Pg. No. 171)
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,R respectively. Represent this situation by a network.
10. Define critical path. (Pg. No. 199)

PART B – (5 * 16 = 80 Marks )

11. A) Solve the following linear programming problem using

graphical method. (Pg. No. 22) (16)
𝐌𝐚𝐱 𝒁 = 𝟏𝟎𝟎𝒙𝟏 + 𝟖𝟎𝒙𝟐
Subject to
5𝒙𝟏 + 𝟏𝟎𝒙𝟐 ≤ 𝟓𝟎

217
 𝟖𝒙𝟏 + 𝟐𝒙𝟐 ≤ 𝟏6
𝟑𝒙𝟏 − 𝟐𝒙𝟐 ≥ 𝟔
and 𝒙𝟏 , 𝒙𝟐 ≥ 𝟎

(OR)

B) Solve the following LPP by simplex method. (Pg. No. 42) (16)
𝐌𝐚𝐱 𝒁 = 𝟒𝒙𝟏 + 𝒙𝟐 + 𝟑𝒙𝟑 + 𝟓𝒙𝟒
Subject to 𝟒𝒙𝟏 − 𝟔𝒙𝟐 − 𝟓𝒙𝟑 + 𝟒𝒙𝟒 ≥ −𝟐𝟎
𝟑𝒙𝟏 − 𝟐𝒙𝟐 + 𝟒𝒙𝟑 + 𝒙𝟒 ≤ 𝟏0
8𝒙𝟏 − 𝟑𝒙𝟐 + 𝟑𝒙𝟑 + 𝟐𝒙𝟒 ≤ 𝟐0
𝒙𝟏 , 𝒙𝟐, 𝒙𝟑, 𝒙𝟒, ≥ 𝟎

12. A) Using dual simplex method solves the LPP. (Pg. No. 75) (16)
𝐌𝐚𝐱 𝒁 = − 𝟑𝒙𝟏 − 𝟐𝒙𝟐
Subject to
𝒙𝟏 + 𝒙𝟐 ≥ 𝟏
𝒙𝟏 + 𝒙𝟐 ≤ 7
𝒙𝟏 + 𝟐𝒙𝟐 ≥ 𝟏𝟎
𝒙𝟐 ≤ 3
and 𝒙𝟏 , 𝒙𝟐 ≥ 𝟎

(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. (Pg. No. 129) (16)
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 optimal allocation of the sales persons to different regions.

218
13. A) Solve the following LPP. (Pg. No. 160) (16)
Minimize 𝐙 = −𝟐𝒙𝟏 − 𝟑𝒙𝟐
Subject to 𝟐𝒙𝟏 + 𝟐𝒙𝟐 ≤ 𝟕
𝒙𝟏 ≤ 𝟐
𝒙𝟐 ≤ 𝟐 and 𝒙𝟏 , 𝒙𝟐 ≥ 𝟎 are Integer

(OR)

B) A student has to take examinations in three courses A, B, and C.

He has three days available for study. He feels it would be best to
devote a whole day to the study of the same course. So that he may
study a course for one day, two days or three days or not at all. His
estimation of grades he may get by study is as follows: (Pg. No. 125)

Course Study days A B C

0 0 1 0
1 1 1 1
2 1 2 3
3 3 4 3

How should he plan to study so that he maximizes the sum of his

grades? (16)

14. A) Using Jacobian method . (Pg. No. 177) (16)

𝐌𝐚𝐱 𝒁 = 𝟐𝒙𝟏 + 𝟑𝒙𝟐
Subject to 𝒙𝟏 + 𝒙𝟐 + 𝒙𝟑 = 𝟓
𝒙𝟏 + 𝒙𝟐 + 𝒙𝟒 = 𝟑
𝒙𝟏 , 𝒙𝟐, 𝒙𝟑, 𝒙𝟒 ≥ 𝟎

(OR)

219
B) Solve the non-linear programming problem by Khun-Tucker
conditions. (Pg. No. 194) (16)
Minimize f(x) = 𝒙𝟐𝟏 + 𝒙𝟐𝟐 + 𝒙𝟐𝟑
Subject to 𝒈𝟏 𝒙 = 𝟐𝒙𝟏 + 𝒙𝟐 − 𝟓 ≤ 𝟎
𝒈𝟐 𝒙 = 𝒙𝟏 + 𝒙𝟐 − 𝟐 ≤ 𝟎
𝒈𝟑 𝒙 = 𝟏 − 𝒙𝟏 ≤ 𝟎
𝒈𝟒 𝒙 = 𝟐 − 𝒙𝟐 ≤ 𝟎
𝒈𝟓 𝒙 = −𝒙𝟑 ≤ 𝟎

15. A) A project consists of activities from A to J as shown in the

following table. The immediate predecessors and the duration in
weeks of each of the activities are given in the same table. Draw the
project network and critical path. Also the total float as well as the
free float for each of the non-critical activities. (Pg. No. 200) (16)

Activity Immediate Predecessor(s) Duration (weeks)

A 4
B 3
C A, B 2
D A, B 5
E B 6
F C 4
G D 3
H F, G 7
I F, G 4
J K, H 2

(OR)

220
B) Consider the data of a project summarized in the following table:
(Pg. No. 205)

Activity Immediate Predecessor(s) Duration (weeks)

a m b
A 4 -1 10

B 1 2 3
C 2 5 14
D A 1 4 7
E A 1 2 3
F A 1 5 9
G B, C 1 2 9
H C 4 4 4
I D 2 2 5
J K, G 6 7 8

(i) Construct the project network.

(ii) Find the expected duration and the 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 36 weeks? (16)

________________________

221
 Question Paper Code: 71693

B.E / B.Tech. DEGREE EXAMINATION, APRIL/MAY 2017

Seventh Semester
Computer Science & Engineering
CS 6704 – RESOURCE MANAGEMENT TECHNIQUES
(Regulation 2013)
Time: Three Hours Maximum: 100 Marks
Answer ALL Questions
PART A – ( 10 * 2 = 20 Marks )

1. Explain slack variables of LP problem. (Pg. No. 6)

2. What is sensitivity analysis? (Pg. No. 8)
3. Define primal and dual problem? (Pg. No. 56)
4. Write the difference between the transportation problem and the
assignment problem. (Pg. No. 54)
5. List different types of Integer programming problems. (Pg. No. 135)
6. Write the Gomory’s constraint for all integer programming problem
whose simplex table (with non integer solution) given below:
(Pg. No. 136)
Cj  2 20 -10 0
Basic
variabl CB XB X1 X2 X3 S1
e
x1 20 5/8 0 1 1/5 3/40
x2 2 5/4 1 0 0 1/4
Z= CB XB = 15 0 0 -14 -1

7. Write down the necessary condition for general non linear

programming problem by Lagrange’s multiplier method for equal
constraints. (Pg. No. 181)
8. Define the Jacobian matrix J and the control matrix C. (Pg. No. 177)
9. Draw the network for the project whose activities and their precedence
relationship are as given below: (Pg. No. 203)
Activities: A B C D E F G H I
Precedence: - A A - D B, C, E F E G,H
10. State the rules for network construction. (Pg. No. 213)

222
 PART B – (5 * 16 = 80 marks )

11. A) Solve the following LP problem using graphical method.

(Pg. No. 28) (16)
𝐌𝐚𝐱 𝒁 = 𝟔𝒙𝟏 + 𝟖𝒙𝟐
Subject to
5𝒙𝟏 + 𝟏𝟎𝒙𝟐 ≤ 𝟔𝟎
𝟒𝒙𝟏 + 𝟒𝒙𝟐 ≤ 𝟔0
and 𝒙𝟏 , 𝒙𝟐 ≥ 𝟎

(OR)

B) Solve the LPP by simplex method. (Pg. No. 48) (16)

𝑴𝒊𝒏 𝒁 = 𝒙𝟐 − 𝟑𝒙𝟑 + 𝟐𝒙𝟓
Subject to
𝟑𝒙𝟐 − 𝒙𝟑 + 𝟐𝒙𝟓 ≤ 𝟕
−𝟐𝒙𝟐 + 𝟒𝒙𝟑 ≤ 𝟏𝟐
−𝟒𝒙𝟐 + 𝟑 𝒙𝟑 + 𝟖𝒙𝟓 ≤ 𝟏𝟎
and 𝒙𝟏 , 𝒙𝟐, 𝒙𝟑 ≥ 𝟎

12. A) Using dual simplex method solves the LPP. (Pg. No. 69) (16)
Minimize Z =2x1+x2
Subject to
3x1+x2 ≥3
4x1+3x2 ≥ 6
x1+2x2 ≥ 3
and x1,x2 ≥ 0

(OR)
B) Solve the transportation problem: (Pg. No. 103) (16)

1 2 3 4 Supply
I 21 16 25 13 11
II 17 18 14 23 13
III 32 27 18 41 19
Demand 6 10 12 15

223
13. A) Find the optimum integer solution to the following linear
programming problem: (Pg. No. 144) (16)

Minimize 𝐙 = 𝒙𝟏 + 𝟐𝒙𝟐
Subject to 𝟐𝒙𝟐 ≤ 𝟕
𝒙𝟏 + 𝒙𝟐 ≤ 𝟕
𝟐𝒙𝟏 = 𝟏𝟏
and 𝒙𝟏 , 𝒙𝟐 ≥ 𝟎 are Integer

(OR)
B) Use branch and bound method to solve the following: (Pg. No. 165)
(16)
Maximize 𝐙 = 𝟐𝒙𝟏 + 𝟐𝒙𝟐
Subject to 𝟓𝒙𝟏 + 𝟑𝒙𝟐 ≤ 𝟖
𝒙𝟏 + 𝟐𝒙𝟐 ≤ 𝟒.
And𝒙𝟏 , 𝒙𝟐 ≥ 𝟎 are Integer

14. A) Minimize f(x) = 𝒙𝟐𝟏 + 𝟐𝒙𝟐𝟐 + 𝟏𝟎𝒙𝟐𝟑 + 𝟓𝒙𝟏 𝒙𝟐 (16)

Subject to 𝒈𝟏 𝒙 = 𝒙𝟏 + 𝒙𝟐𝟐 + 𝟑𝒙𝟐 𝒙𝟑 − 𝟓 = 𝟎
𝒈𝟐 𝒙 = 𝒙𝟐𝟏 + 𝟓𝒙𝟏 𝒙𝟐 + 𝒙𝟐𝟑 − 𝟕𝟓 = 𝟎

Apply the Jacobian method to find δf(x) in the feasible neighborhood

of the feasible point (1, 1, 1). Assume that the feasible neighborhood is
specified by δg1 = -0.1, δg2 = 0.02 and δx1 =0.01. (Pg. No. 177)

(OR)
B) Solve the non linear programming problem by Lagrangian
multiplier method. (Pg. No. 183) (16)
Minimize Z = 𝒙𝟐𝟏 + 𝟑𝒙𝟐𝟐 + 𝟓𝒙𝟐𝟑
Subject to 𝒙𝟏 + 𝒙𝟐 + 𝟑𝒙𝟑 = 𝟐
𝟓𝒙𝟏 + 𝟐𝒙𝟐 + 𝒙𝟑 = 𝟓
𝒙𝟏 , 𝒙𝟐 , 𝒙𝟑 ≥ 𝟎

224
15. A) The following 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. (Pg. No. 205)

Activity : 1-2 1-3 1-4 2-4 2-5 3-4 4-5

a : 2 3 4 8 6 2 2
m : 4 4 5 9 8 3 5
b : 5 6 6 11 12 4 7

(i) Draw the network

(ii) Find the critical path
(iii) Determine the expected standard deviation of the
completion time.
(16)
(OR)

B) A project schedule has the following characteristics:

(Pg. No. 203)

Activity : 1-2 1-4 1-7 2-3 3-6 4-5 4-8 5-6 6-9
7-8 8-9
Duration : 2 2 1 4 1 5 8 4 3
3 5
(i) Construct a PERT network and find the critical path and
the project duration
(ii) Activities 2-3, 4-5, 6-9 each requires one unit of the same
key equipment to complete it. Do you think availability of
one unit of the equipment in the organization is sufficient
for completing the project without delaying it; if so what
is the schedule of these activities? (16)

___________________________

225