BACHELOR'S DEGREE PROGRAMME

Size: px

Start display at page:

Download "BACHELOR'S DEGREE PROGRAMME"

Evan French
5 years ago
Views:

1 No. of Printed Pages : 11 MTE-12 BACHELOR'S DEGREE PROGRAMME Term-End Examination C 3 ti June, ELECTIVE COURSE : MATHEMATICS MTE-12 : LINEAR PROGRAMMING Time : 2 hours Maximum Marks : 50 Note : Question no. 1 is compulsory. Do any four questions out of 2 to 7. Calculators are not allowed. 1. Which of the following statements are true? 10 Give reasons for your answers : (a) Every convex set has at the most finitely many extreme points. (b) If A and B are 3 x 3 matrices with IAN = 0, then at least one of the matrices A or B has rank less than three. (c) (d) (e) If the primal LPP is infeasible, the dual is also infeasible. In an optimal solution of a balanced transportation problem with 3 sources and 4 destinations, it is possible to have 7 routes over which a positive quantity is transported. The pay off matrix of any game can have at most one saddle point. MTE-12 1 P.T.O.

2 2. (a) Use the graphical method to solve the 6 following LPP : Max 2x1 + 3x2 subject to x1 + xi x2?-0, x2.?; 0x 1.20 and Ox2.12. (b) Find the dual of the following LPP : Max subject 2x1 + x2 subject to xi +5x25_10, +3x2.- 6, 2x1 + 3x2 = 8, x2?-0 and xi unrestricted (a) Solve the following LPP by simplex method : 5 Max 2x1 +3x2 + x3 subject to 7x1 + 3x2 + 2x3 5 4x1 + 2x2 x3 2 xi, x2, x3 > 0 (b) Write the mathematical model of the 5 following transportation problem : D1 D2 D3 D4 Supply S S Demand Also, find an initial basic feasible solution using North-West corner method. MTE-12 2

3 4. (a) Find an initial basic feasible solution using 6 matrix minima method and hence solve the following transportation problem using u v method. From To A B C Available I II III Demand (b) Find all the basic solutions of the following 4 equations : xi + X 2 + 2x3 = 5 2x1 X 2 + X3 = 4 Which of the solutions are feasible? Justify your answer. 5. (a) Solve the following game graphically : 5 Player B [ Player A 3 2 (b) Solve the following cost minimising 5 assignment problem : I H Ill IV A B C D MTE-12 3 P.T.O.

4 6. (a) Prove algebraically that the set 5 S = {(xi, x2) /2xf + x2 5._ 4} is a convex set. (b) Use the method of dominance to reduce the 5 size of the following game, and hence find its solution : (a) Players A and B simultaneously call out 5 either of the numbers 19 or 20. If their sum is even, B pays A that number of rupees. If the sum is odd, A pays B that number of rupees. What is the pay off matrix for this game? Find the optimal strategies for both the players. (b) A company has two grades of inspectors, 5 I and II, who are to be assigned for a quality control inspection. It is required that at least 2000 pieces be inspected per 8 - hour day. A grade I inspector can check at the rate of 40 per hour with an accuracy of 97%. A grade II inspector checks at the rate of 30 pieces per hour with an accuracy of 95%. The wage rate of a grade I inspector is Rs. 5 MTE-12 4

5 per hour while that of a grade II inspector is Rs. 4 per hour. An error made by an inspector costs Rs. 3 to the company. There are only nine grade I inspectors and eleven grade II inspectors available in the company. Formulate the problem of minimising the daily inspection cost as an I,PP. MTE-12 5 P.T.O.

6 ztrai cro 4cbi-1 trfivi 2012 gicktisto-i : 41ruli 1figet) Liq : 2./(1 37fiwdTr : 50 1 : rft 31.?-1-7TWq I M.Y fi-dRi t 1 Siql f WT.( drh 0f:3N 47(-11,c.?dj Tr Trehr civ-? `I Gcl 4 A cb -I 74 2.N tip t? drlt. t 10 cbruf r\tr (a) 1374T 3-Tq-ITU T111-7E1-'4 t 3-TW A Lirtfi-mcf: fq-it11 (b) ik A 3th B, 3 x3 311-&F fq-ik IABI =0 t,-4/6ittbaituuwaw1414wgrf*-1:ft cn-r14 iw (c) irq 31Ttf LPP artrrd t 71,1-4 ad1 3ITITM I (d) 3 Tht iftall 4T-01' TirdU tift769' W1:1 c't 14, 7 1:R Ti WIT #1.T-4 t I MTE-12 7 P.T.O.

7 (e) fc 31-r--&ff Trd-r-i 3fti-T 31-fqw.icht'llt I 2. (a) F'1+-irciroci LPP arn A 60 : 6 2x1 + 3x2 3-ifq-*71:1t-*77 I 7'qfT x1 +x2530, xl x2 > 0, x2.>- 3, 05x1520 bit 05x2512. (b).tati LPP 711c1 : 4 2x1 +x2 3-1fq-*7711M-711T v T : 7-4f- xi +5x2510, xi + 3x2?- 6, 2x1 + 3x2 = 8, x2 >0 34 x1 13TIXF-d-4RTU I 3. (a) {47 LPP ch) ittz.11 PART 4 Sri : 5 2x1 + 3x2 + x3 WI 3-Tfq--*---d-rn--*---m 7-4F-T 7x1 + 3x2 + 2X x1 + 2x2 X3 5 2 xi, x2, x3 > 0 (b) 14-1 Oci o.-1 Trr-R:zu f,trukilq 5 tfur : D1 D2 D3 D4 3Trf4 S I S S Ttf alit- 14 -NN bra qiicf "4-177 I MTE-12 8

8 4. (a) 31.Py wffalt fdlit A Mitt i1t 3-TINTA Ord 6 ql1c1.41-4r atit $TI u v fa-na c-14--iroftgd trft-q-ri Trff-Frr -1 : I II III Trin (b) (.1 (.1 CI 41rntuI 3TTNTA URI 4 5. (a) x 1 +x 2 + '-) x 3 =5 2x1- )72 4-x A A Ili ( chi f-h--irokld Tia TA Tzaq rcirq fil71v B ftglat[ i A ] art er1f4r : 5 (b) (4,1RTI fuu (14-1-1C1 4-IchR1 f17-m-9. teaf 7F 5 I II III IV A B C O MTE-12 9 P.T.O.

9 6. (a) WTtzi Fa F4 Al : 5 S = {(x1, x2) /24 + x2 < 4} kitmciq t (b) rcir(gd 31-1-WR ci.wt4 t 5 1-tit -9-Tgerr fqfq a>> F,TK : _ 7. (a) i ilsl A at B TI124 i zffq a 1 > 417,11:It, B, A c71 c1 4,1GR t I rq q.)41 tf -a-1 A,Ba71 d1irz far t I 74" yr-drff cilr5q1 r ttc w -11C1 I (b) t, ttral -.9T1:1-4z7 I 5-0T4Z7, 1147tui chl cf,1 *PA \ t I 31-* chi t fef 9Thfq ch4-1 chi aittf 171 (4-) I -14c1-d.( q qtal't 171 'Hcbdi t- 7i11-4. zizttot 97% t I ' MTE-12 10

10 II.14.4e.( 30.q11 cf 'A.,Tti-cf T7 kichcn t 712.4T 2k 95% t ' I ciic; 1T:Te 7 5 T. mrcf 311-{ II cilc tp4-4z7 =h1 Wit) 7 4 T. 51iscr t tp4-47-{ fe., T. TzfR7 tp4-4z-{ t I tf9t SRI TFR:Err LPP Tcfqff MTE-12 11

BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination June, 2013 ELECTIVE COURSE : MATHEMATICS MTE-12 : LINEAR PROGRAMMING

No. of Printed Pages : 12 MTE-12 BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination June, 2013 ELECTIVE COURSE : MATHEMATICS MTE-12 : LINEAR PROGRAMMING Time : 2 hours Maximum Marks : 50 Weightage