tee No: TCD) B.EJ/B.Téch. DEGREE EXAMINATION, APRIL/MAY 2017. Seventh Semester Computer Science and Engineering CS 6704 - RESOURCE MANAGEMENT TECHNIQUES Regulations 2013) ‘Time : Three hours Maximum : 100 marks Answer ALL questions. PART A — (10 x 2 = 20 marka) 1. Explain slack variables of LP problem. 2. Whats sonsitivity analysis? 3. Define primal and dual problem? 4. Write the difference between the transportation problem and the assignment problem. : 5. List different types of Integer programming problems. 6. Write the Gomory’s constraint for the all integer programming problem whose simplex table (with non intoger solution) given below : C,>2 2 -10 0 a 7. Write down the necessary condition for general non linear programming problem by Lagrange's multiplier method for equal constraints.Define the Jacobian matrix J and the control matrix C. Draw the network for the project whose activities and their precedence relationship are as given below : Activities: ABCDE F GH I Precedence: - A A - D B,C,E F E G,H State the rules for network construction. PART B —(6 x 16 = 80 marks) (a) Solve the following LP problem using graphical method. Maximize z=6z, +8x, ‘Subject to 5x, +10x, <60 4x, +4x, <60 x and x,20. : = a6) _ Or (b) Solve the LPP by simplex method Min 2=x,-9x,+2x5 Subject to 8x, x, +2x, 7 2x, r4x, $12 ~ 4x, +9x, + 8x, $10 4. %q.%520. e a6) C J) (0) Using dual simplex method solve the LPP Minimize 2=2x,+2, Subject to 8x, 47,23.) 4x, +3x, 26° 4, +2x,23 and x;,x,20. a6) 2 7169313. ua ® (a) @) Solve the transportation problem : as) 1 2 3 4 Supply I 216 25 13 n wisw 2 2B I 82 27 18 41 «19 Demand 6 10 12 15 Find the optimum integer solution to the following 7 programming problem = Maximize 2=3, +22; Subject to 2x, 37 *+%,$7 2x, =11 and x,.x;20 and are integers. (a6) and x,,x,20 and mse a6) y Maximize f(z) =27 (a0 nn Subject to E a m(a)=x, +22} +825) -5=0 e(x)= hr; 42} 7500 Apply te Jacobian method to find f(x) in the feasible neighbourhood of the feasibla point (1,1,1). Assume that the feasible neighbourhood is specified by Og, =-0.1, ég, =.02 and @r, =.01. a6) me 3 71693(&) Solve the nonlinear programming problem by Lagrangian multiplier method. ! Minimize. z «x? + 3x3 +5x} Subject to the constraints wy +x, 43x, =2 Gx, 42x, 4x, =5 (16) %, Xp,%y 20. 15. (a) The following indicates the details of a project. The durations are in days. ‘ad’ refers to optimistic tine, ‘m' refers to most likely time and 't’ refers to - pessimistic time duration. Activity: 1-2 1-3 1-4 2-4 2-5: 3-4 4-6 a: z 3 48 6 SS# m: 4 4 6 8 8 (a )6 b: 6 6 6..41).3. 7 @® Draw the network (i). Find the critical path (ii) Determine the expected standard deviation of the completion time, Or b) Aproject schedule has the following characteristics : Activity: 1-2 1-4 1-7 23 36 45 48 56 69 78 89 Destin: 2 2: UDXeXy 5 8 4 38 3. 5 @ 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 90 what is the schedule of these activities? 4 71693