Reg. No. Question Paper Code : 52877 B.E/B.Tech. DEGREE EXAMINATIONS, APRIL/MAY 2019. Seventh Semester Computer Science And Engineering * CS 6704 ~ RESOURCE MANAGEMENT TECHNIQUES (Regulation 2013) ‘Time : Three hours Maximum : 100 marks 10, Answer ALL questions. PART A — (10 x 2= 20 marks) What is OR techniques? Where it can be used? Define following terms. (a) Solution (b) Feasible solution, Explain degeneracy in transportation problem. Write down the steps of North West Corner Method for solving transportation problem. Why integer programming is needed? Generalize it. Summarize the main disadvantage of the branch and bound method. List the uses of classical optimization theory. Describe the concepts of Lagrangian multiplier. Illustrate the primary rules for Network construction. Point out the uses of GANTT chart.11. 12. (a) (b) (a) b) PART B— (6 x 13 = 65 marks) Solve by Simplex Method @ Max Z= 8x, + 4x, Subject to the conditions 2x, + 4x, £120; 2x, + 2x, < 80; x, 20,2220 (i) Maximize Z = 8x, + 2x, +5:x, Subject to Constraints By +X_ +X $9; 2x, +3x, +5; x, <30; 2x,-x,-x,58 and By ,XqX4 20. ‘ Or : ‘The advertising alternative for a company include television, radio, and newspaper advertisements. The costs and estimates for audience coverage are given in the table below. Television Radio Newspaper Cost per advertisement £2,000 £300 £600 Audience per advertisement 1,00,000 18,000 40,000 The local newspaper limits the number of weekly advertisements from a single company to ten. Moreover, in order to balance the advertising among:the three types of media, no more than half of the total numiber of advertisements should occur on the radio, and at least 10% should occur on television. The weekly advertising budget is £18,200. How many advertisements should be run in each of the three types of media to maximize the total audience? Find the initial feasible solution for the following problem using North West Corner Method. Optimize solution using stepping stone. Consumption centres Warehouses _ Requirements “Units) Pl P2 P3 P4 C1 4 9 5 25 c2 nS ag 25 cs 3 8 6 9 25 Capacity 9 28 20 18 Or Solve by Vogel’s Approximation Method. Plants Warehouses Supply W1 W2 W3 W4 W5 Pl “20 28 32 55 70 50 P2 48 36 40 44 25 100 P3 35 «55 «22 «45 «48 150 Demand 100 70 50 40 40 300 2 5287713. 14, 16, (@) (a) (b) (a) Discuss “Gomary’s Cutting plane method and solve it. Maximize z=x,+4x, Subject to 2x, + 4x, <7, 5x + 3x, < 15; 2, xzare integers 20 Or Summarize and find the optimum integer solution to the following alll LPP: Maximize z + Diy Subject to 2x, <7; x, +2, <7; 2x, <11; x,, x) > 0 and integers. Discuss the Non Linear programming problem and solve by using Logrange multipliers with equality constraints Maximize Z = 4x, — 0.1x? + 5x, - 0.248 Subject to x, +2x, = 40; x,, x, 20 Or Describe in detail about the Newton-Raphson method. A project has the following characteristics. Construct a own PERT network. Find critical path and variance for each event and also analyze it. Or A project consists of the following activities as. shown in table. The duration in weeks and the manpower requirement for each of the activities are also summarized in the same table. Find and give the project schedule which minimizes the peak manpower requirement and + also minimizes period-to-period variation in manpower requirement (number of iteration = 2), Activity Duration Manpower (months) Required 1-2 5 12 13 23 24 3-4 25 35 5-6 4-6 Aare RIBS one wan 3 5287716. (@) ) PART C—(1 x 15 = 15 marks) Unit profit of five salesmen in four places are given below Pi Pa Pa Py Demand S 40 woe ou 30 Ss aoa e 40 Si 40 Ss Available 6 40 5 50 60, 50, 30 Solve the problem to maximize the profit. Or Solve the integer programming problem Maximize Z.= 80x, + 45%, Subject to tay <7 12x, + 5x, < 60 and x,, x, > Oand integer. 52877