12 §] El] @iLinear Programmin [12.3 EXERC ee WATS Hix + 7y subject to the constraints: “ 2r+ys6,x<2,x20,y20 2 Sol. Given that: Z = 11x + 7y and the constraints 2x +y <6, 2<2, *20,y20 x Let2xty=6 zo [3 ys fo ‘The shaded area OABC is the feasible region determined by X*————5} the constraints 2+ys6,x<2,x20,y20 ‘The feasible region is bounded, Y So, maximum value will occur at a comer point of the feasible region. "Corner points are (0,0) (2, 0),(2,2) and (0,6). Now evaluating the value of Z, we get Corner points, Valve of Z 00,0) 1110) +7(0)=0 AQ, 0) - 112) + 7(0) = 22 BQ, 2) 112) +7(2)=36 0,6) 110+ 76) =42. | & Maximum _._ Hence, the maximum value of Zis 42 at (0,6). . Maximise Z=3x +4y, subject to the constraints:x +y <1, x20, y20. | Given that: Z=3x + 4y and the constraints x +y <1, x20, y20 Let x y(Q3. Maximise the function Z = 11x + 7y subject to the constrain Sol. Sol. The shaded area OAB is the feasible region determined by xtyS1x20,y20. ‘The feasible region is bounded. So, maximum value will occur x4——_| — at the comer points O(0, 0), 9 AGL, 0), BO, 1). Now, evaluating the value of Z, we get Bia Corner points Value of Z (0, 0) 3(0) + 4(0)=0 A(L 0) 3(1) + 4(0)=3 B@, 1) 3(0) +40) "4 | @ Maximum Hence, the maximum value of Z.is 4 at (0, 1). xS3,y 82,720,920. The shaded region is the feasible region determined by the constraints x53, y $2, ¢ sek te region is g four comers O| So, the maximum value can ‘occur at any corer. Let us evaluate the value of Z. Value of Z 11(0)+7(0)=0 11(3) + 7(0) = 33 BG, 2) 11@)+7)=47 GO2) 11@)+7@)=14 ‘Hence, the maximum value of the function Z Comer points (0,0) AG,0) Maximum is 47 at ( Minimise Z = 13x 15y subject to the constraints: yS7,2x-3y +620,x20,y20. Given that: Z = 13x — 15y and the constraints x+YyS7,2x-3y+620,220,y20 402 Bl _NCERT Excuptar Prostems Matematics-Xil Letxty=7 z[sy4 vebaels Let 2x =3y+6=0 c 21-3 x x y | 2-20. 9 * ‘The shaded region is the feasible region determined YY by the constraints x + y <7, 2x-3y+6>0,x20,y20 ‘The feasible region is bounded with four corners 0(0, 0), A(7, 0), B(3, 4), C(O, 2) So, the maximum value can occur at any comer. Let us evaluate the value of Z. Comer points Value of Z 200, 0) 13(0)= 15(0)=0 AZ, 0) 13(7)= BG, 4) 13(3)-15(4) == 21 C2) 13) 15@)=-30 | — Minimum Hence, the minimum value of Z is ~ 30 at (0, 2). Determine the maximum value of Z = 3x + 4y if the feasible region (shaded) for a LPP is shown in figure. ‘As shown in the figure, OAED is the feasible region. ALA, y= 04 2e+y=104 91552 Which gives comer point A= (62,0) ALD, 2=0 2.x +2y=76> y=38 Which gives comer point D = (0, 38) Now solving the given equations, we get Qe ty 104 De vdy = 182 2 ty = 104 ooo Sy = 4 sy=16 Linear Procrawns lm 403x+2(16) = 76 = = 76-32-44 So, the comer point E= (44, 16) Evaluating the maximum value of Z, we get Comer points Value of Z AG,2) | Z=11G)+7@)=47 BOS) | Z=11(0)+76)=35 Corner points Zax vay C03) | Z=110)+76)=21 | — minimum (0, 0) Z=3(0) + 4(0) = 0 Hence, the minimum value of Z is 21 at (0,3). ‘AG2, 0) Z= 3(52) + 4(0) = 156 8. Refer to Exercise 7 above. Find the maximum value of Z. E(44, 16) Z=3(44) + 4(16)= 196 | «Maximum Sol. As per the evaluating table for the value of Z, itis clear that the maximum value of Z is 47 at (3,2). Dl, 38) Z= 3(0) +A(38) = 152 reer Q9. The feasible region for a LPP is shown in figure. Evaluate Z= 4x +y at each of the corner points of this region. Find the minimum value of Z, ifit exists. Sol. As per the given figure, ABC is the feasible region which is open unbounded. Here, we have Hence, the maximum value of Z is 196 at (4, 16). Q6. Feasible region (shaded) for a LPP is shown in figure. Maximise Z = 5x + 7y. Sol. OABC is the feasible region ‘whose comer points are and x+2y=4 ¢ . Zadcry 2, = x Solving eq, (2) and (ii), we get Comer points Value of Z x=2andy=1 x O| x Z=5()+7(0)=0 So, the comer points are = 235 A, 0), BC, 1) and C(O, 3) vt z a er 3 Let us evaluate the value of Z Ss =43 | Maximum oe rouge Hence, the maximum value of Zis 43 at (3, 4). BQ,1) | Z=4Q)=()=9 Q7, The feasible region for a LPP is shown in figure. Find the minimum value of Z= 11x +7y. 7 CO, 3) Z=4(0)+@)=3 © Minimum Sol. As per the given figure, minimum value of Z is 3 at (0, 3) but since, the ARCA “ate a € feasible region is open bounded so it may or may not be the region. _ Come minimum value of Z. C(O, 3), BQO, 5) and for A, Therefore, to face such situation, we draw a graph of 4x+y<3 we have to solve equations and check whether the resulting open half plane has no point x+3y=9 “7 in common with feasible region. Otherwise Z will have no and xty=5 ‘minimum value. From the graph, we conclude that there is no eae ee Ps 2 common point with the feasible region. ie, AG, Hence, Z has the minimum value 3 at (0,3). 10. In given figure, the feasible region (shaded) fora LPPis shown. ~ Determine the maximum and minimum value of Z=x+2y. Evaluating the value of Z, we get 404 BI NOERT Exewrtae Proa.sus Manienancs-Xil = Lnera Pragranana mm 405two types of circuits A and B. Type A requires 20 resistors, 10 transistors and 10 capacitors. Type B requires 10 resi transistors and 30 capacitors. Ifthe profit on type A circuit is, ‘50 and that on type B circuit is & 60, formulate this problem asa LPP so that the manufacturer can maximise his profit. . Let x units of type A and y units of type B electric circuits be produced by the manufacturer. As per the given information, we construct the following table: tems | Type AG) | Type B (y)_| Maximum stock Resistors 20 10 200 ‘Transistors 10 20 120 Capacitors 10 30 150 Profit 50 e60 | Z=50x+60y Now, we have the total profit in rupees Z = 50x + 6y to ‘maximise subject to the constraints 20x + 10y <200 10x +20y < 120 Ci) ox +30y < 150 #2020 0) Hence, the required LPP is, ‘Maximise Z = 50x + 60y subject to the constraints 20x + 10y <200 = 2x+y <20; 10x + 20y < 120 = x + 2y< 12 and 10x +30y S150 => x+3y<15,x20,y20 ‘A firm has to transport 1200 packages using large vans which can carry 200 packages each and small vans which can take 80 packages each. The cost for engaging each large van is € 400 and each small van is € 200. Not more than ® 3000 is to be ‘pent on the job and the number of large vans cannot exceed the number of small vans. Formulate this problem as a LPP given that the objective is to minimise cost. | Let x and y be the number of large and small vans respectively. From the given information, we construct the following corresponding constraints table; a Sol. Here, comer points are given as follows: 7 3) 6(3 15) p(3 2 (8 2) 73), o(2,28), pf 3,24) ana (38,2), *ba) a. a) *S 3) Bs Fi Now, evaluating the value of Z for the feasible region RQPS. Corner points [Value of Z=x+2y n(Z2) | zaZea()-s ve ag of.) 2=$42(2)=9 << Maximum i (2.2) z-B2(2)-2. © Minimum ~ Tens ‘Sinalleans 3.15 wy) | Hence, the maximum value,of Z is 9 at (3,28) and the Packages 30 ‘ axe Cost 200 3000 sminimum value of Zs = at @ 2). Now the objective function for minimum cost is ie Z~ 400x+200y " Q41. Amanufacturer of electric circuits has a stock of 200 resistor, Subject to the constraints; 120 transistors and 150 capacitors and is required to prodi 200r+80y 21200 => Sx+2y230 “a 406m NCERT Exewpar Prostens Mariewavios-XIl Linear Procramnic lm 40740x +200y ¢ 3000 => 2e+y<15 . xsy and x20,y20 (non-negative constraint) Hence, the required LPP is to minimise Z= 40x + 200y Subject to the constraints Sx + 2y = 30, 2x +y $15, x5 y and =20,y20. Q13. A company manufactures two types of screws A and B. All the screws have to pass through a threading machine and sloting uéchoe Nbax of type Asciews teieaes) igi the threading machine and 3 minutes on the slotting machine A box of type B screws requires 8 minutes of threading on threading machine and 2 minutes on the slotting machine. lt week, each machine is available for 60 hours. (On selling these screws, the company gets a profit of € 100 pet box on type A screws and & 170 per box on type B screws Formulate this problem as a LPP given that the objective iso maximise profit. 4 Sol. Let the company manufactures x boxes of type A screws and y boxes of type B screws. From the given information, we can construct the following Sol. table. ‘tens Type A lable (a) Time required on re fi cee eee |e 8 | 60*60=3600 minutes ‘Time required on 80 seo tiie Haddin 3 2 | 60% 60=3600 minutes Profit e100 | 170 ‘As per the information in the above table, the objective function for maximum profit Z= 100x + 170y Subject to the constraints 2x + By £3600 = x+4y £1800 ol) 3x +2y < 3600 @) x20,y20 (nonnegative constrain’) Hence, the required LPP is Maximise Z= 10x +170y Subject to the constraints, x+y $ 1800, 3x + 2y $3600, x20, 20. Que. A company manulactures two types of sweater: type aad typeB.Itcosts €360 to make atype A sweater and €120tomale &type B sweater. The company can make at most 300sweii and spend at most & 72000 a day. The number of sweaters ob 408 = NCERT Exewear Proatens MarHewancs—Xil Sol. type B cannot exceed the number of sweaters of type A by more than 100, The company makes a profit of € 200 for each ‘sweater of type A and & 120 for every sweater of type B. Formulate this problem at a LPP to maximise the profit to the ‘company. Let x and y be the number of sweaters of type A and type B respectively. From the given information wehavete following constrain 360x+120y 572000 => 3x+y<600 x+ys300 x¢1002y= y, according to the given etal ea | x20)y20 Srr218 > arsy29 49 [2 LOLS 213 [0 Onaeitng od D +8y221 xeyo7 papery Here, the feasible region’ Perdy216 = x+2yE8 Gi) Pe pO Pe yls po *20,y20 (0) The price of each table of X type is € 2 and that of yi Sr Pico ach able ofX ype at of y ist. Minimise Z= 2x + y subject to the constraints Sry 29, x+y27,242y>8,x2 Oy 20 y Let us evaluate the value of Z. Corner points [Value of Z = 1000x + 500y 00,0) [Z=0+0-0 ‘A(40, 0)” [Z=1000(40) +¥0= 40,000 | -tMaxietam B(25, 30) | Z=1000(25) +500(80)=40,000 | Maximum (0, 45) |Z=0+ 500145) =22500 Hence, the maximum profit is 40,000 by producing 25 bikes of Model X and 30 bikes of Model Y. (Q23. In order to supplement daily diet, a person wishes to take some X and some wishes Y tablets. ‘The contents of iron, calcium and vitamins in X and Y (in milligram per tablet) are J \ given as below: * On solving (i) and (ii) we get x=6andy=1 416 Gi NCERT Exenpvar Prostews Mariemancs-XIl LincAR PROGRAMMING BI 417‘On solving (i) and (i) we getx=1 and y=6 From the graph, we see that the feasible region ABCD is unbounded whose corner points are A(8, 0), B(6, 1), C(l, 6) and D(0, 9). Let us evaluate the value of Z Corner points | Value of Z= 2x +y AGO) [Z=2(8) +0=16 B(6, 1) Z=26)+1-13 Z=2(1)+6=8 | «Minimum Z=20)+9=9 Here, we see that 8 is the minimum value of Z at (1, 6) but the feasible region is unbounded. So, 8 may or may not be the minimum value of Z. ‘To confirm it, we will draw a graph of inequality 2x +y 5x +2y> Similarly for model C, nee 90x+40y 24800 = 3x+4y> andx>0,y20 ese It cas s 12,000 and % 15000 to operate the factories [ and II <, Required LPP is ‘Minimise Z = 12000x + 15000y subject to the constraints Sx +4y > 640 Sr+2y > 400 3x4 dy 2 480 x20,y20 Table for (i) equation 5x + 4y = 640 = [0 [a8 vy [ie] 0 ‘Table for (i) equation Sx + 2y = 400 = [0 7 80 y [200 [0 ‘Table for (ii) equation 3x + 4y = 480 x | 0 | 160 y | 120] 0 On solvin, (i anya (i and (iii), we get el, Linear PRocRamwNe = 419scant From the graph we se that ADB is open : Cectieg oa ee Whose comersare 00,0) A(0., 008 ee From the graph, we see that the feasible region ABCD is op Let us evaluate the value of Z ‘unbounded whose corners are A(160, 0), B(80, 60), C(32, 120) and D(0, 200), Let us find the values of Z. Corner points | Value of Z= 12000: + 15000y “A(160, 0) _| Z= 12000(160) +0 = 1920000 'B(80, 60) | Z= 12000(60) + 15000(60) = 1860000 Minimum €G@2, 120) |Z=1200062) + 15000020) = 2184000 Dio, 200) _ | Z=0-+ 15000(200) = 3000000 From the above table, itis clear that the value of Z = 186000) may or may not be minimum for an open unbounded region. Now, to decide this, we draw a graph of ‘12000 + 15000y < 1860000 = 4x + 5y < 620 land we have to check whether there is a common point in this feasible region or not. So, from the graph, there is no common point. ™, Z-='12000x + 15000y has minimum value 1860000 at (80, Factory 1: 80 days Value of Z=3x—4y Factory Tl: 60 days. eee (25. Maximise and minimise Z = 3x ~ 4y subject to x ~ 2y $0) Z=0 Mini w3r+ys4,x-ys6andx, y20. seus ia Sol. Given LPP is B(I2, 6) | Z=3(12)-4(6) = 12 ‘ Maximise and minimise Z = 3x — 4y subject to 7 cao. i at For this unbounded region, the value of Z may or may not be reysd 0 Ste = 16.S0 to decideit, we draw a graph of inequality 3x—4y<-16 aoe and check whether the open half plane has common poin's an ce s = 7 fh feasible region or not. But from the graph, we see that 7 it has common points with the feasible region, so it will have Se not minimum value of Z. Similarly for maximum value, we ert {ete draw the graph of inequality 3x — 4y > 12 in which there is no [ ‘common point with the feasible region. ace ony, as d oa Hence, the maximum value of Zis 12. Qbo: we NCERT ExSwiak Proce MiriesaricsXIl" $= ST TT Livear Proseawwuns ml 4211 OBJECTIVE TYPE QUESTIONS i Choose the correct answer from the given four options in each of the Exercises 26 to 34. ‘026. The comer points of the feasible region determined by system of linear constraints ar (0, 40), (20, 40), (60, (G0, 0). The objective function is Z = 4x + 3y. Compare the quantity in Column A and Column B . Colts A ‘Maximum of Z (@ The quantity in column Ais greater. information supplied. Sol. Value of Z= + 3y Z=0 Z=0+3(40) =120 Z= 40) +340) = 200 Z=4(60) +3@0)=300 | Maximum (60,0) | Z=4(60) +3(0) = 240 Hence, the correct option is (#). ¥ Q27, The feasible solution for a LEP is shown in figure. Let ~ dy be the objective imum of Z Value of Z= 3x —4y Z=0 Z=36)-0=15 Z=3(6)-4@)=—2 Z=3(6)— 48) == 14 Z=3@)— 40) =~ 28 0,8) [Z=30)—48)=-22 | Minimum “Hence, the correct option is (6). 422. NCERT Exenear Prostews Maremarics—Xll (Q26. Refer to Exercise 27. Maximum of Z occurs at 60) © 65) © 68) (@ (4109) Sol. According to solution of Q. 27, the maximum value of Z is 15 at 6, 0). Hence, the correct option is (). (29, Refer to Exercise 27. (Maximum value of Z + Minimum value of Z) is equal to (a) @®1 (©) -13 (@ -17 Sol. According to the solution of Q. 27, Maximum value of Z = 15 and Minimum value of Z=—32 So, the sum of Maximum value and Minimum value of Z = 15+(-32)=-17 Hence, the correct option is (@). Q30. The feasible region for an LPP is shown in the figure. Let Fx ~4y be the objective function. Maximum value of Fis @0 os OR @-18 y ‘A.(12.6) (4) o *Xx oo) oe Sol. The feasible region is shown in the figure for which the objective function F = 3% — 4y Comer point | Vitue of F= 3x ~ dy 000) [F=0 A(2,6)_[F=3(12)-46)=12 | « Maximum BO,4) [F=0-4(4)=-16 Minion Hence, the correct option is (c). Q31. Refer to Exercise 30. Minimum value of F is (0 ®-16 (12d) doesnotexist According to the solution of Q. 30, the minimum value of F is-16 at (0,4). Hence, the correct option is (). Si Linear Procravwins 423Q32. Comer points of the feasible region for an LPP are (0, 2), (3,0) Lot F = dx + 6y be the objective function. ‘minimum value of F occut ‘on the line segment joining the points (0,2) and (0) Sol. [Comer points | Value of F= 4x + 6y Z=40)+6@=12 |< Minimum Z=48)+6)=12 | © Minimum Z=4(6)>6()=24 Z=46)+68)=72 |< Maximum Z=4(0) + 6(5) = 30 g F 933. i (@) 60 () 48 @2 @B Sol. According to the solution of Q. 32, ‘Maximum value of F - Minimum value of F = 72-12 ~ 60 Hence, the correct option (Q34. Comer points ofthe feasibl of linear constraints are minimum of Z occurs. @) p=2q © p= A pma Sol. ‘of Z= px qy:p.q>0 So, condition of p and q so that the minimum of Z occurs (3,0) and (1, 1) is 4 pi qn Sp = p-3p+q=0 = p>. Hence, the correct option is (b). 424 NCERT Exem.ar Prootems Martewarics-XiIl Fill in the blasiks in each of the Exercises 35 to 41, Q35. Ina LPP, the linear inequalities or restrictions on the variables are call h 37. If the feasible region for a LPP is. then the optimal value of the objective function Z =a: + by may or may not exist. Sol. open unbounded Q38. In a LPP if the objective function Z = ax + by has the same maximum value at two comer points of the feasible region, then every point on the line segment joining these two points give the same . value, A feasible region of a system of linear inequalities is said to be if itcan be enclosed within a cizcle. le region is a point in the region two boundary les. whether the statements in Exercises 42 to 45 are True or F (Q42. Ifthe feasible region fora LPP is unbounded, maximum or! mum of the objective function Z= nx + by may or may not exist. Sol. True. Q43, Maximum value of the objective function Z-=ax+ by ina LPP always occurs at only one comer point of the feasible region, Sol. False. QM. Ina LPP, the minimum value of the objective function Z= ax + by is always 0 if the origin is one of the corner point of the feasible region. Sol. False. QU. In a LPP, the maximum value of the objective function Ze ax+ by is always finite. Sol. True. goa Liner Procramnic 425