This question paper contains 4 printed pages} Rott No. [| [ | S.No. of Question Paper: 6672 UniquePaperCode _—: 62361101 FC Name of the Paper : Introduction to Operational Research and Linear Programming Name ofthe Course: B.A.Programme Semester il Duration :3 Hours Maximum Marks: 75 1 @ (0) 2 @ (6) 3. @ (Write your Roll No. on the top immediately on receipt of this. question paper.) Attempt any five questions. All questions carry equal marks: Discuss the origin and development of O.R. Explain briefly application of OR. 7 Define the convex set. Prove that the set : S ={(ay, xp): Bxp + 2x} < 6} is convex set. 246 Explain the concept of duality in linear. programming problem. Prove that dual of the dual is primal. 7 Obtain the dual of the following primal problem: 8 Maximize Z= 2x, + x9 + x5 Subject to %1 + %2 + Xs 2 6, Bxy — Oxy + 9x5 = 4x, +8x, - 6xy =1, x1, % 2 0, 2x, is unrestricted. Define basic feasible solution to a system of linear equations. Find all the basic feasible solutions to the following system of linear equations : 245 my + Qey tay = 4 Qe, +x + 5x = 5 PTO.C2) (b) The following is the optimum table to the linear programming problem : Maximize .Z = 3x; + 42%, Subject to x, < 4, x $6, Bx, + 2xp $18, x,%22 0. | c,| 3] 5) 0} o} 0 To, | Yp Xp ¥/%1¥s| Ya) Ys 0}. x5 2| 0} 0] 1] 2/3|-1/3 5 a 6| 0] 1] 0 1] 0 3 % 2| 1| 0} 0|-2/3| 1/3 0} 0) 0 3 1 6672 Discuss the effect on the optimality of the solution, when the objective function is change to 3x) +X, 8 4, (a) Whatconditions must exist in a simplex table to establish the existence of infeasible solution ? Find the solution of the following L.P.P. : Maximize Z = —x, = x2 Subject to 3% + 2x 2 30, 2x, + 8x < -30, a +X, $5, Hy, %y.2 0. 245(6) @ () (3) 6672 An electronic company is engaged in the production of two components C, and Cy used in TV sets. Each unit of C, costs the company Rs. 25 in wages and Rs. 25 in material, while each unit of C3 costs the company Rs. 125 in wages and Rs. 75 in material. The company sells both products on one-period credit terms, but the company’s labour and material expenses must be paid in cash. The selling price of C, is Rs. 150 per unit and of C> is Rs. 350 per unit, Because of the strong monopoly of the company for these components, itis assumed that the company can sell at the prevailing prices as many units as it produces. The company’s production capacity is, however, limited by two considerations. First, at the beginning of period 1, the company has an initial balance of Rs. 20,000 (cash plus bank credit plus collections from past credit sales). Second, the company has available in each period 4,000 hours of machine time and 2,800-hours of assembly time. The production of each C, requires 6 hours of machine time and 4 hours of assembly time, whereas the production of each C> requires 4 hours of machine time and 6 hours of assembly time. Formulate this problem as a linear programming" problem’so as to maximize the total profit to the company. 8 Usé dual simpiex method to solve the following L.P.P : 7 Minimize Z = 3x, + x, Subject to ay +x, 21, 2x, + Bx_ 22, pH 20. (What is degeneracy ? Discus a method to resolve degeneracy in L.P.P. (i) Use graphical method to solve the following L.P.P : 44 Maximize Z = 2x, + 4x2 Subject to x, + 2x, <5, ntm <4, xy, %_ 20. PTO.6. (@)_ Solve the following linear programming problem by two-phase method : Minimize Z = x, +x, Subject t0 2x, +, 24, % + Tx, 27, x, x 20. (6) Solve the following linear programming problem by simplex method : Maximize Z = 3x, + 2x, + 5%, Subject to %1 + 2p +5 $430, Bx, +2x,< 460, y+ 4x, < 420, 4, Xp, Xz 20. 7. "Write short notes on any three of the following : (Sensitivity analysis (ii) Economic interpretation of duality (ii) Complementary slackness (iv) Simplex method Vs. Dual simplex method. 6672 4 6672 3xS=15 100