Important treated us malpractice. USN LITT vse sr Time: a b, Sixth Semester B.E. Degree Examination, December 2012 Operations Research Max. Marks: 100. Note: Answer FIVE full questions, selecting at least TWO questions from each part. PAR’ ‘What is operations research? Mention six phases of an operations research study. (06 Marks) Old hens ean be bought at Rs.50/- each but young ones cost Rs,100/- each. The oki hens lay 3 egus/week and young hens 5 egys/week. Each egy cost Rs.2/- A hen costs Rs.5!= per week to feed. Ifa person has only Rs.2000/- to spend for hens, ormulate the problem to decide how many of each kind of hen should he buy? Assume that he cannot house more than 40 hens. (07 Marks) Solve the following L.P.P. graphically Maximize 2 =100x, + 40x Subject © 5x, +2x, $1000 3x, +2N, < 900) (07 Marks) ‘Mention five assumptions of linear programming (os Marks) Define and illustrate with examples slak variables and surphus variables, (04 Marks) Solve the following LPP: Maximize 7 =15x, +68, #98, +28 Subject 0 2s, #4, +5x, +6x, $20 4 3x, +x, +48, +298, < Ix, +x, 570 Xyakpexy 20 CU Marks) Explain two phase technique to solve LPP in simplex method. (06 Marks) Use Big-M method to solve the following LPP Minimize z= x, #3xy Subject to 2x, +x, 210 =3y, 42x, £6 XX, 26 and x,.x, 20 (14 Marks) What are the important characteristics of duality? (05 Marks) Explain the conceptual procedure of revised simplex method in standard form, (10 Marks) lor4 6 Write the dual of the following LPP: Minimize 7 = 38, ~6x, +48, Subject to 4x, 43x, + 6x, 29 x, +2x, +38, >6 = 2x, 510 st6x,24 Explain sensitivity analysis. Use the dual simplex method to solve the following LPP: Maximize z= -2x, Subject 10 2x, +3x, BK), x ods and §,.8,.%, 20 Explain different steps in Ifungarian algorithm to solve an assignment problem. Find the optimal transportation cost of the following ma BIC] DIE [Supply 2 1[2[6[9} 100 gle fala ts ]7 [120 R 2}6/[4]s} 120 Demand | 40 [30] 70 [9090 Solve the game whose pay off matris is given by. A ron 124s 434 Bins 40 V1 6 4 Explain the following: i) Minimax and maximin principles ii) Pare and mixed strategies iii) Two person zero sum game, iv) Dominance principles. Give a note on basic simulated annealing algorithm, Write an outline of a basie genetic algorithm, Explain table search algorithm, Explain decision trees 06CS661 (05 Marks) (08 Marks) (12 Marks) (08 Marks) by using least cost method, (12 Marks) (08 Marks) (12 Marky) (08 Marks) (08 Marks) (05 Marks) (05 Marks)