RAJA COLLEGE OF ENGINEERING & TECHNOLOGY 12) a) Construct the dual of the LPP

MADURAI-20
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
(i) Min Z = 4x1 + 6x2 + 18x3 (ii) Max Z = 2x1 + 5x2 + 3x3
MODEL EXAM
Subject to x1 + 3x2 ≥ 3 Subject to 2x1 + 4x2 – 3x3 ≤ 8
x2 + 2x3 ≥ 5 -2x1 – 2x2 + 3x3 ≤ -7
SUB. CODE: CS6704 SUB. NAME: Resource Management Techniques x1 , x2 , x3 ≥ 0 x1 + 3x2 – 5x3 ≥ -2
YEAR : IV SEMESTER : VII 4x1 + x2 + 3x3 ≤ 4
x1 , x2 , x3 ≥ 0

Date: 21.10.2016 Time: 1.20PM – 4.20 PM Maximum 100 marks

(iii) Consider the problem of assigning five jobs to five persons. The
Part – A assignment costs are given in the table below. Determine the optimum
(Answer All Questions) 10 x 2 = 20 Marks assignment schedule.
1) Define Feasible Solution and Optimal Solution of LPP. Job 1 2 3 4 5
2) State the limitations of linear programming. Person
3) Differentiate transportation and assignment problem. A 8 4 2 6 1
4) List 4 Primal-Dual Relationships with Example. B 0 9 5 5 4
5) What is IPP? Give its importance. C 3 8 9 2 6
D 4 3 1 0 3
6) What are methods to solve IPP?
E 9 5 8 9 5
7) Draw architectural diagram of classical optimization theory.
8) Define Local and Global maximum with graph.
(or)
9) What are the 2 basic planning and controlling techniques?
12) b) Use Dijkstra’s Algorithm to find the shortest route between node
10) Define Total Float, Free Float with formula.
Part – B 1 and every other node in the network.
(Answer All Questions) 16 x 5 = 80 Marks
11) a)(i) What is degeneracy?Write down the method to solve
degeneracy.(8)
(ii) Write about modeling phases and discuss in detail the phases of
OR.(8)
(or)
11)b) Solve by Simplex Method. (16)
Max Z = 3x1 + 2x2 Subject to x1 + x2 ≤ 4 , x1 – x2 ≤ 2, x1,x2 ≥ 0.
Pg : (2)
Pg : (1)
13) a) (i) Give the algorithm for branch and bound technique.(8) (or)
(ii) Write the steps for the Gomory’s cutting plane algorithm with 15) b) A Small project is composed of activities whose time estimates
flowchart.(8) (or)
are listed in table below. Activities are identified by beginning (i) and
13) b) A 4-ton vessel can be loaded with one or more of three items.
The following table gives the unit weight wi in tons and the unit ending (j) node numbers. (i) Draw the project network
revenue, in thousands of dollars ri for item i. How should the vessel be (ii) Find the expected duration and variance for each activity.
loaded to maximize total return?(16)
What is the exp. project length?
Item i Weight wi Revenue ri (iii) Calculate the variance and standard deviation of the project length.
1 2 31
2 3 47 What is the probability that the project will be completed?
3 1 14 (a) Atleast 4 weeks earlier than expected?
(b) No more than 4 weeks later than expected duration.
14) a) (i) Find the maximum or minimum of the function (8)
F(x) = x12 + x22 + x32 – 4x1 – 8x2 – 12x3 + 56 (iv) If the project due is 19 weeks what is the probability of meeting the
Note : Unconstrained External Problem. due date given the data table.
(ii) Consider the following functions f(y) = y4 , g(y) = y3. Draw the Z 0.5 0.67 1.00 1.33 2.00
graphical plot & find if yois the minimum point.(8)
P 0.1915 0.2486 0.3413 0.4082 0.4772
(or)
14) b) Consider the following problem.(16)
F(X) = x12 + 3x22 + 5x1x32 Activity Estimated Duration ( in Weeks)
G1(X) = x1x3 + 2x2 + x22 – 11 = 0, G2(X) = x12 + 2x1x2 + x32 – 14 = 0. (i– j) Optimistic Most Likely Pessimistic
Given the feasible point xo = (1,2,3) , we wish to study the variation of 1-2 1 1 7
F = ðcf in the feasible neighbourhood of xo where ðx2 = 0.01 1-3 1 4 7
Note : Solve by Jacobean method.
1-4 2 2 8
2-5 1 1 1
15) a) Compute the Earliest Start, Earliest Finish, Latest Start and
Latest Finish of each of the activity of the project given below: (16) 3-5 2 5 14
4-6 2 5 8
Activity 1-2 1-3 2-4 2-5 3-4 4-5
5-6 3 6 15

Duration (in days) 8 4 10 2 5 3

Pg : (4)

Pg : (3)