this question paper contains 4 printed-pages:] |, foNo-of Question Paper + 6620 De / Inique Paper Code = 235505 ame ofthe Course: B.Se. (Ions. MATHEMATICS ame of the Paper - _: Linear Programming and Theory-of Games (Paper V. 4 £ Semester iV Duration : 3 Hours ruetions for Candidates 1. Write your Roll No. on the top immediately on, is question paper. \ Ss Feasible region, there corresponds ing problem 2. Attempt any two parts of each questions 3. All questions carry equal mark}. agri wo ‘ mG a, = 1 is a feasible solution of the system of equations x, +x, + 2x24 2x, - x, +x, = 2 Is this solution basic feasible ? If not, reduce it to a basic feasible solution. PTO.1020 (@) 0) 2 fs i ‘oblem Using two phase method, solve the linear programming Pr Minimize z = 3x, + 2x, + x, subjectto 2x, + 5x, +x, = 12 1 3x, ¥ 4x, x, is unrestricted, x, 2 0, x, 20. Using simplex method, solve the system of equations =_ UY 3x, + 2x, 44 Also, find inverse of the coefficient matrix * a 2 4-1) Using big-M method, solve the lineaisprograiining problem Minimize =z = subject to, x, b7o st oy, i aby . &, ij Werify*that the dual of the dual is primal. e Maximize z = 8x, + 3x, subjectto x, — 6x, < 2 Sx, + Tx, <4 x20, x,20y F 6620. | 3.4 F av Obiain the dual of the following primal orem : Maximize 2 = 7X, # 12x, 10%, subject to 3x, + 2x, - 4x, $1 % x, 48, Bh 23 ) 2x, + 8x,=2 x, 50, x,20, x, is unrestricted. PP i ee the following linear programming problem using duahty § = Minimize 2=2x,t9x, +e - 2 subjectto. x, + 4x, + 2x, 25 4 x 3x, 4 x, + 2x, 24 x,20,:x,20, % \ me hy. ep 0, yp 2% 20 | 1 15 0, 12 by 7 Olio 25 ~ & Ye i | st 10 Deiiagd=]5, 5 is | ois | 1s (), sofffhe Bllowing cost minimization assignment problem : a » I 1 Mi Vv Vv Ng Rey, [SoA u | 1 | 7 fim % | 8 7 13 22 7 10 | a c {10 7 2 2 2 D Noa 10 8 6 UL E EN 1s 16 10 18 , PTO.—- 4 6620, “4 i @ it ay-off matrix : or (@ Find the saddle point for the yam~ havirsg the Following pay . , 3 1g 2 i 1 2 1 02) GB) Determine the range of vall;zs of p and q that will render saddle point for the game | 5 24$ .% “t 10 7 qi = 4p 6, 5... (a) Use dominance relation to reduce the fo) hence find the optimum strategies and Value ‘ o ree vy sD ; hte E oat ¢ ) % 2203 = J 6 7 : : oC xy SM “& dh x a (2800) e a +2)