06CS661 USN | Sixth Semester B.E. Degree Examination, June-July 2009 Operations Research Time: 3 hrs. Max. Marks:100 Note: Answer any FIVE full questions, selecting at least TWO questions from each part. PART—A 1 a. Define : i) Feasible solution ii) Feasible region _ iii) Optimal solution (06 Marks) b. A manufacturer produces three models I, Il, ITI of certain product using raw materials A and B. The following table gives the data for the problem : Requirements per unit Raw material I TL |__| Availability A 2 3 5 4000 B 4 2 7 6000 Minimum demand | 200 | 200 | 150 : Profit per unit (Rs) 30 20 50. * Formulate the problem as a linear program model. (07 Marks) ©. Using graphical method solve the LPP. Maximize Z= 5x; +4x2 Subject to 6x; + 4x) 24 x $2x2 <6 “xi +x2<1 x22, x1,%220 (07 Marks), 2 a. Define slack variable and surplus variable. (04 Marks) b. Find all the basic solutions of the following system of equations identifying in each case the basic and non basic variables. 2x, +X, 44x, 511, 3x, +x, +5x, =14 (06 Marks) c. Using simplex method of tabular form solve the LPP. Maximize Z = 4x; + 3x2+ 6x3 Subjectto 2x; + xr + 2x3 < 440 xy + 3x3 £470 2x1 + Sx £430 X1, X2,%5 20 (10 Marks) 3. a. Using two-phase method solve the LPP. Minimize Z=7.5x1 - 3x2 Subjectto 3x -x2-xs>3 x1-%t%22 X41, 2,320 (10 Marks) b. Using Big-M method solve the CPP. Maximize Z= 2x) +% Subjectto 3x; +2 =3 4x, +3026 xy + 2x <3 x1,%220 (10 Marks) 1of3|. Use Revised Simplex Method to solve the LPP. Maximize Z = 3x; + 5x2 Subjectto 2x <4 2xz < 12 3x1 + 2x2 S18 X1, X22 0 Explain: i) Weak duality property ii) Strong duality property iti) Complementary solutions property Write the dual of the following : i) Maximize Z= 6x; + 10x2 Subjectto x) 514 2516 3x; + 2x <18 x1,%220 ii) Maximize Z=(5 8) fe PART-B In Parametric Linear Programming explain about : i) Systematic changes in the Cj parameters. ii) Systematic changes in the bj parameters. Using dual simplex method solve the LPP. Maximize Z=-3x; - 2x2 Subjectto x; #x2> 1 x1tX227 x1 +2x)>10 x23 xL%m20 06CS661 (0 Marks) (06 Marks) (04 Marks) (08 Marks) (12 Marks) ‘The transporation costs per truck load of cement (in hundreds of rupees) from each plant to each project site are as follows : Project sites [ee Sa eae . 1L2 73 iT 716 supply Factories 2/71 One: [Tae 3s | 8 | 5 | 9 |10 7 5 3 weoakln Demand Determine the optimal distribution for the company so as to minimize the total ‘transportation cost. (12 Marks) |. Four jobs are to be done on four different machines. The cost (in rupees) of producing i" job on the j* machine is given below : 2of3Machines M;__M,_— M3 My 3 { 15 7 7 13 (1s Jobs 37 ae d{ 14 [1s [10 [14 4 (16 [13 [at [az Assign the jobs to different machines so as to minimize the total cost. 7 a. Solve the game whose payoff matrix to the player A is given below : B 1 on w 1-(P instep, A ule [2,7 1 b. Solve the following (2 x 3) game graphically. Yi YY ee ee a Ifa 3] Ain offs | sl] 2 8 a. Use Tabu Search algorithm to find the optimal solution of Fig. Q8 (a) b. Give note on outline of a Basic Simulated Annealing Algorithm. ©. Give note on outline of a Basic Genetic Algorithm. tees 30f3 (08 Marks) (10 Marks) (10 Marks) (08 Marks) (06 Marks) (06 Marks)