Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
com
NANDHA COLLEGE OF TECHNOLOGY,ERODE-638052
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
CS6704-Resource Management Techniques
Question Bank
UNIT-I
Two Marks
1. What do you mean by Operations Research (OR)?
Operation research is scientific approach to problem solving for executive decision making
which requires the formulation of mathematical, economic and statistical model for decision
control problems to deal with situations arising out of risk and uncertainty.
Examples:
Public transportation network
Planning in a city having own layout of factories
Limitations
Distance between OR specialist and manager
Magnitude of calculations
Money and Time cost
Implementations
Eg: X1+X2>=800
2X1+3X2>=600
X1+X2-S1+A1=800
2X1+3X2-S2+A2=600
6. Write the Canonical form of LPP and the Standard form of LPP.
Canonical form of linear programming problem: The linear programming problem can
always be expressed as in the following form
Max or min Z=c1x1+c2x2+………….cnxn
Subject to
a11x1+a12x2+………..+a1nxn<=or>=b1
a21x1+a22x2+………..+a2nxn<=or>=b2
.
.
Get useful study materials from www.rejinpaul.com
K.NITHYA AP/CSE NANDHA COLLEGE OF TECHNOLOGY
www.rejinpaul.com
.
ai1x1+ai2x2+………..+ainxn<=or>=bi
.
.
am1x1+am2x2+………..+amnxn<=or>=bn
where x1,x2………xn>=0
1. The agriculture research institute suggested to a farmer to spread out at least 4800 kg of a special
phosphate fertilizer and not less than 7200 kg of a special nitrogen fertilizer to raise the
productivity of crops in his yields. There are two sources for obtaining these mixtures A and B.
Both of these are available in bags weighing 100 kg each, and they cost Rs.40 and Rs.24
respectively. Mixture A contains phosphate and nitrogen equivalent of 20kg and 80kg
respectively, while mixture B contains these ingredients equivalent of 50kg each.
Formulate the LPP and solve the problem using graphical solution method. (8)
2. (i) List out the graphical method procedure to solve simple linear programming problems of two
decision variables. (4)
(ii) Examine the following LP problem using graphical method (4)
Minimize Z = 2x1 + 3x2
Subject to
x1 + x2 ≥6
7x1 + x2 ≥14
x1 and x2 ≥ 0.
Theory
Lathes 10 5 2500
Determine the number of parts I and II to be manufactured per week to maximize the
profit by any method. (16)
(a) If the right hand side constants of the constraint 1 and constraint 2 are changed from 60 and
40 to 40 and 20 respectively.
(b) Check whether addition of new constraint 6x1 + 3x2 ≤ 48 affects the optimality. If it does
find the new optimum solution.
UNIT-II
Two Marks
1. Write the dual of the following LPP
Max Z= X1+X2
STC
2X1+X2 ≤ 2
-2X1+X2 ≥ -5
X1,X2 ≥ 0
Solution
Min Z=2 Y1+ 5 Y2
2 Y1+2 Y2 >= 1
Y1- Y2 >= 1
9. Enumerate the method to find initial basic feasible solution for transportation problem
North-west corner method
Least cost cell method
Vogel’s approximation method
Subject to 2X1+3X2 ≥ 10
4X1 + 9X2 ≥ 15
6X1 + 6X2 ≥ 20
X1,X2 ≥ 0
Sensitivity Analysis
1. Explain the concept of post optimality analysis using following methods. (8)
(iii) Making changes in the right hand side constants of the constraint
Transportation Problem
1. Consider the following transportation problem involving three sources and four
destinations. The cell entries represent cost of transportation per unit. (16)
Obtain IBFS (Initial Basic Feasible Solution) using North-West Corner Method and VAM
then optimize the solution using U-V (MODI) Method.
Assignment Problem
1. (i) Write the procedure for Assignment problem. (6)
(ii) A company has team of four salesmen and the company wants to do business in four
districts. Considering the capabilities of salesmen and the nature of districts, the company
has estimated the profit per day in rupees for each salesman in each district as below:
2. Company has one surplus truck in each of the cities A, B, C, D and E and one deficit truck
in each of the cities 1, 2, 3, 4, 5 and 6. The distance between the cities (in km) is shown in
below matrix.
Find the assignment of trucks from cities in surplus to cities in deficit so that the distance
covered vehicles is minimum. (16)
Dijkstra’s Algorithm
1. Find the shortest path from node1 to node 9 of the distance network using Dijkstra’s
Algorithm. (16)
UNIT-III
Two Marks
1. What are the conditions a problem to be Fathomed?
A problem is said to be fathomed if any one of three conditions are met.
i. The value of decision variable of the problem are integers
ii. The upper bound of the problem which has non-integer value for its decision
variable is not greater than current best lower bound
iii. The problem has infeasible solution
Get useful study materials from www.rejinpaul.com
K.NITHYA AP/CSE NANDHA COLLEGE OF TECHNOLOGY
www.rejinpaul.com
2. Write the fractional cut for the source row;
(1+0)X1 + (0+ (1/3))S1 + ( (-3/3) +(1/3))S2 = 0+ (1/3)
-(1/3)S1-(1/3)S2 + S3 = -1/3
Sixteen Mark
Cutting Plan Algorithm (Pure Integer Programming)
1. Consider the following integer linear programming problem and solve it. (16)
Max Z= 5X1+ 8X2
Subject to
X1 + 2X2 ≤ 8
4X1 + X2 ≤ 10
X1, X2 ≥ 0 and integers.
2. Consider the following integer linear programming problem and solve it. (16)
Max Z= 5X1+10X2 + 8X3
Subject to
2X1 + 5X2 + X3 ≤ 10
X1 + 4X2 + 2X3 ≤ 12
X1, X2 and X3 ≥ 0 and integers
Get useful study materials from www.rejinpaul.com
K.NITHYA AP/CSE NANDHA COLLEGE OF TECHNOLOGY
www.rejinpaul.com
3. Solve the following linear programming problem by cutting plane algorithm
Maximize Z = X1 + 2X2
Subject to X1 + 2X2 ≤ 12
4X1 + 3X2 ≤ 14
X1 , X2 ≥ 0 and integers.
3. Select the shortest highway route between two cities. The network in figure provides the
routes between the starting city at node 1 and the destination city at node 7. The roués pass
through intermediate cities designated by nodes 2 to 6.
UNIT-IV
1. Describe the Unconstrained problem.
The graph of a continuous function Y=f(x) of a single independent variable x in the domain
(a,b). The domain is the range of values of x. The domain limits are generally called stationary
points. There are two categories of stationary points: inflection points and extreme points. The
extreme points are further classified as either local or global extreme.
Local extreme represents the maximum or minimum values of the function in the given range of
values of the variable points.
Global extreme represents the maximum (or minimum) values of a function is the maximum (or
minimum) value among all local maximum (or minimum) values of a function
2. A sufficient condition for a stationary point x0 to be an extreme is for the Hessian matrix H
evaluated at x0 to be
(i). Positive definite when x0 is a minimum point.
(ii). Negative definite when x0 is a minimum Point.
Xn+1 = Xn -
18 x1 + 10 x2 = 0 18 x1 = 0 X1 = 0
It determines the earliest occurrence times of the events. In this phase, the computations at
Get useful study materials from www.rejinpaul.com
K.NITHYA AP/CSE NANDHA COLLEGE OF TECHNOLOGY
www.rejinpaul.com
node 1 and advance recursively to end node n.
Initial Step: Set Project starting time as 0
General Step j : Given that nodes p,q…and v are directly linked to node j by incoming
activities (p, j) (q, j),.. and (v,j) and that the earliest occurrence times of events(nodes)
p,q…and v have already been computed, then earliest occurrence time of event j is
computed as
Δj=max{ Δp+Dpj , Δq+Dqj , …. Δv+Dvj}
Δj represents the longest path to node j
Forward pass calculation used to find earliest start and finishing time (EST, EFT)
Backward Pass Calculations
It calculates the latest occurrence time. Following the forward pass, the backward pass
computation starts at node n and progress recursively to node 1,
Initial Step: The earliest and latest occurrences of the last event of the project are same
General Step j :
Given that nodes p,q…and v are directly linked to node j by outgoing activities (p, j)(q,j),..
and (v,j) and that the latest occurrence times of events(nodes) p,q…and v have already been
computed, then latest occurrence time of event j is computed as
Δj=min{ Δp-Dpj , Δq-Dqj , …. Δv-Dvj}
The backward pass is complete when Δj at node 1 is computed.
Backward pass calculation used to find latest start and finishing time (LST, LFT)
Slack = Li -Ei
10. Find out the probability of completing the project 5 days earlier than expected
(Actual Completion Time (µ) = 28 days, σ = 2)
Z = (X- µ)/ σ
= (23 – 28) / 2
= -2.5
P (Z <= -2.5) = 0.5 –P (0 ≤ Z ≤ 2.5)
= 0.5 – 0.4938
= 0.0062
Sixteen Mark
Network Diagram
1. Illustrate the primary rules for Network construction and construct a project network for a
construction company that has listed down various activities involved in constructing a
community hall. These are summarized along with immediate predecessor(s) details in table. (8)
Activity A B C D E F G H I J K L M N
Predecessor - - A B A C,D F E,G H I J,L A K M
Critical Path Model
1. The followin table gives the activities of a costruction project and duration (8)
Let us construct the network for the project and identify the critical path
Get useful study materials from www.rejinpaul.com
K.NITHYA AP/CSE NANDHA COLLEGE OF TECHNOLOGY
www.rejinpaul.com
2. Determine the critical path for the project network shown below. All the durations are in
days. Compute the floats for the non-critical activities of the network in the figure and
discuss their use in finalizing a schedule for the project.
PERT
1. Consider table below summarizing the details of a project involving 11 activities.
Resource Levelling
1. Consider the problem of project scheduling as shown in table. Obtain a schedule which will
minimize the peak manpower requirement and also smooth out priod to period variation of man
power requirement.