a ea PROGRAMMING BASIC CONCEPTS Arrow diagram for bounded /unbounded region. Feasible region (having largest nd smallest vanes ‘Mand MofZ =a% + by at comer points) eas ands Opel plane termi sn vale asly>Mandeceye mblaned to common point inthe al {io common poit in he al ddeiminadby sy >04 and eae deter by aby cman segen ten Migwnastimvaloe of sql then’ mona ake oF, ZelhetviZhenomasinumscke. “thesne hee no minimum ae MULTIPLE CHOICE QUESTIONS Choose and write the correct option in the following questions. 1. The feasible region for an LPP is shown below: INCERT Exemplar, CBSE 2020 (65/3/1)] Let Z = 3x ~ dy be the objective function. Minimum of Z occurs at (a) (0,0) © (08) O69 @ (4,10) 170] Mathematics-Xil: Term-12. Comer points of the feasible region determined by the system of linear constraints are (0, 3), (1,1) and (3,0). Let Z = px + qy, where p, q > 0. Condition on p and q so that the minimum of Z occurs at (3, 0) and (1,1) is (@ p=29 pt © p=34 @ pag 3. Which of the following is a convex set? (@) (G,y):x*+y? 25) @ Ieyiv2a) (©) (Gx, y):3x? +4y?>5) (@) My 0Sx 51,08 4 Let Z, and Z, are two optimal solution of a LPP, then (@) Z=2z, + (1-A)Z,, NEB isalso on optimal solution ( Z=2Z,+(-2)Z,AE [0,1] gives optimal solution (2) Z=2Z,+(1+Z,, AE [01] gives optimal solution (@) Z=2Z,+(1+2)Z, AER gives optimal solution 5. The maximum value of Z = 4v + Sy subject to constraint x+y <10, x,y 20 is @ 3% @ 40 (©) 20 (d) none of these 6. Consider a LPP given by Min Z= 6x + 10y subject to x2 6 y 2 2;2x+ y>10;x,y20 Redundant constraints in this LPP are @ x20y20 — ) ¥26,2e+y210 (©) 2v+y210 (d) none of these 7. Which of the following statements is correct (a) Every LPP admits an optimal selection (0) ALPP admits unique optimal solution (©) Ifa LPP admits two optimal solutions il has an infinite solution. (@) The set of al feasible solutions of a LPP is not a convex set 8. Which of the following is not a convex sel? (a) (Ga, y)l2e45y<7) OM yirty say (© belxl=5) (a) {Gx y)| Sx? + 2y? <6} 9. The comer points of the feasible region determined by the following system of linear inequalities 2xty S10, x+3y £15, x, y> 0 are (0,0), 6,0), 3,4) and (0, 5). Let Z= px+ qy, where p,q>0. Condition on p and q s0 that the maximum of Z occurs at both (3, 4) and (0, 5) is @ p=a p=m © p=34 ( a= 3 10. The maximum value of Z=x+3y such that 2x+y <20, x+2y <20,x=0,y=0is @ 1 @ 20 (© 00 o® 1. By graphical method solution of LLP maximize Z=x+y subject to xtys2 xiy20 obtained at (@) only one point (®) only two points (0) at infinite number of points (2) none of these Linear Programming ]1712 13. cra 16. vw. 18. 172| Objective function of a LPP is (@) constraint (8) a function to be optimized (0) a relation between the variables {d) none of these The objective function Z = dv + 3y can be maximised subject to constraints Br t dy S24, 8x4 by $48, 55,4 56,220 (@) atonly one point (8) al two points only (0) atan infininte number of points (a) none of these The point at which the maximum value of Z = x + y, subject to constraints x+2y $70, 2x+y <95, x,y>0 is obtained, is (a) (30,25) () (20,35) (© 5,20) (@ (40,15) By the graphical method, the solution of LPP Maximize Z = 3x, +5%, subject to 3x, +2¥, © 18 4 6 ay X20 is (@) x, =2,4,=0,2=6 (x, =2.%,= 62-36 (© 4545532227 (0) x= 4.x. = 6,2 = 42 Solution of LPP maximize Z = 2v-y subject tox+y 52 xy20 @o wa @2 (@ none of these The comer points of the feasible region determined by the system of linear inequalities are (0, 0), (4, 0), (2, 4) and (0, 5). If the maximum value of Z = ax + by, where a, b> O occurs at both (2, 4) and (4,0), then (a) a= 2b (b) 2a=b (a=b (a) 3a=b The graph of the inequality 2x + 3y > 6s (a) half plane that contains the origin. (0) half plane that neither contains the origin nor the points of the line 2x + 24 (0) whole XOY- plane excluding the points on the line 2x + 3y = 6. (@) entire XOY plane. The point which does not lie in the half plane 2x + 3y—12<0is (a) (1,2) M21 © @3) (@ (3,2) The value of objective function Z = 2x + 3y at comer point (3, 2) is @5 9 12 (d) none of these The corner points of the feasible region determined by the system of linear constraints are (0, 10), (5, 5), (15, 15), (0, 20). Let Z ~ px + gy, where p, q > 0. Condition on p and 4 so that the maximum of Z occurs at both the points (15, 15) and (0, 20) is (Pp ©) p=2q (© q=2p (@ q=3 The position of origin (0, 0) wez.t. feasible region represented by x+y > Lis (@ in the region (®) notin the region (©) on thelinex +y=0 {@) none of these ‘The feasible region for an LPP is always a (@) typeof polygon (8) concave polygon (¢) convex polygon (4) none of these Mathematics-XiI: Term-124, Feasible region shaded for a LPP is shown in figure. Maximum of Z = 2v + 3y occurs at the point ©) (0,0) 4,0 oOo” (d) none of these 25. ‘The maximum value of Z = 0.7x + y for feasible region given below is y @ 45 (40 © 50 ma 26. A point out of following points lie in plane represented by 2x+3y < 12 is (@) (0,3) ©) 8.3) 04,3) @ @,5) 27. Feasible region is the set of points which satisfy (@ the objective functions (®) some of the given constraints (6) all of the given constraints (@) None of these 28. Objective function of a LPP is (@) a quadtatic function () aconstant (©) a linear function to be optimised (d) None of these Answers a) 2.(0) 3. (d) 4.0) 5.0) 6.0) 7. 8. (6) 9. (d) 10. @) 1. @ nw 8.0) 14. () BY) 16. @) 47. (a) 18. (0) 1. (©) 20. (c) 2d) 2. ©) 23. (©) ©) 23. 26. (a) 27. (d) 28. (0) oy NS TS eee Sy lelt) Choose the correct option in the following questions. 1. Read the following and answer any four questions from (i) to (e). Ashare is referred to asa unit of ownership which represents an equal proportion ofa company’s capital. A share entities the shareholders fo an equal claim on profil and loss of the company. Dr. Ritam wants to invest at most €12,000 in two type of shares A and B. According to the rules, Linear Programming ]173she has to invest at least €2000 in share A and at least 24000 in share B. Ifthe rate of interest on share A is 8% per annum and on share B is 10% per annum, ON Wscaa Sa Glos Answer the questions given below. (# IfDe. Ritam invests vin share A, then which of the following is correct? (@) x=2000 () x <2000 () xs 2000 (@ x> 2000 (ii) If she invest 2y in share B, then which of the following is correct? (@) y=4000 (®) y= 4000 (oy > 4000 (@ y= 4000 (i) IC al interest received by Dr. Rita from both type of shares fy represented by Z, then Bisequalte a = @ 2=Rxry HZ=REHW |Z=(Z+X) w2-(F+H) (in) To maximise interest on both types of share, the invested amount on both shares A & B by her should be respectively (a) 210,000, 72000 (b) 2,000, 710000 (c) 28,000, 74000 (a) 22,000, 74000 (v) The maximum interest received by her is @) e100 (83000 (o) 81160 ( &1200 Sol. () Since, she has to invest atleast 82000 in share A. ce > 2000 Option (dis correct, Gi) Since, she has to invest atleast 84000 in share B. 2 y> 000 Option (i) is correct. (iii) Interest on share A = Interest on share B= yxy = 7 Hob reset +) Option (¢) is correct. (io) Wehave 1=(BE+ab wi ito bemaimist under consents x2 2000 ato and x> y= 12000 174] Mathematics-Xil: Term-12000000 a ey vos ~ STE] ae p aon EPP P POPE Here, ABC be bounded feasible region with corner points A(2,000, 10000), B (8000, 4000), C(2,000, 4000) Now we evaluate Z al each corner points. Comer Point ‘A (2,000, 10000) BB (8000, 4000) € (2,000, 4000) ie for maximum intere: Option (b) is correct. (@) Obviously For x = %2000, y = 810000 22000, 10000, Fy 10 = 160 + 1000 = %1160 Option (¢) is correct. x= 82000, y= 710000 Ze 2. Read the following and answer any four questions from (i) to (x) A dealer Ramprakash residing in a rural area opens a shop to stazt his business. He wishes to purchase a number of ceiling fans and table fans. A ceiling fan costs him 2360 and table fan costs 2240, } Linear Programming ]175Answer the questions given below. (i) If Ramprakash purchases * ceiling fans, v table fans. He has space in his store for at most, 20 items, then which of the following is correct @) x+y=20 (ext y>20 ()x+y<20 W@xty <2 (ii) If Ramprakash has only 25760 to invest on both type of fans, then which of the following, is correct @ x+y < 5760 (6) 3600 + 240y £5760 (©) 360x + 240y 2 5760 (3x +2y $48 (iii) Ihe expects to sell et profit Z is expressed as ling fan at a profit of 222 and table fan for a profit of 218, then the @ Z=18r+2y —WZ=Ir+I8y (Z=x+y (Z < 22x + 18y (io) If he sells all the fans that he buys, then the number x, y of both the type fans in stock to get maximum profit is @x=10y=12 @x=12y=8 Ox (©) The maximum profit after selling all fans is @ %0 (0) 8560 (6) 21000 Mean 6 y=0 (@x=8,y=12 Sol. (i) From question Hie has space in slore for almost 20 ilerns arty S20 Option (@) is correct (i) From question Maximum investment = %5760 ‘Total cost for him to purchase both type of fans = 360x + 240y 36x + 240y < 5760 = 3r+2y < 48 Option (@) is correct (iti) Profit on ceiling fan: Profit on table fans Z=2x+ By Option (0) is correct. (iv) Wehave (Profit) Z = 22r + 18y, which is to be maximized under constraints 3x4 2y < 48 x+y 20 x.y & O[-+ Number of fans can never be negative] 3. Read the following and answer any four questions from (i) to (0). Aeroplane is an important invention for three reasons. It shortens travel time, s more comfortable and facilitates the transport of heavy cargo ‘An aeroplane can carry a maximum of 200 passengers. A profit of 2400 is made on each executive class ticket and a profit of 2300 is made on each economy class ticket. The airline reserves at least 20 seats for executive class. However al least 4 times as many passenger prefer to travel by economy class than by executive class, 176] Mathematics-XIl: Term-1Answer the questions given below. (0 If there be x tickets of executive class and y tickets of economy class be sold, then which of the following is correct? @ x+y=200 x+y 2200 (e) x+y >200 (@) x+y<200 (ii) Which pair of constraints are correct? @ x2 40and x<20 © x< Mand x>20 (©) x20 (@ x=40andx>40 (iii) If profit earned by airlines is represented by Z, then Z is given by (@) Z=300x + 400y () Z =400% + 300y © Zexty ()Z=4r+3y (iv) Airlines are interested to maximise the profit. For this to happen the value of x and y ie, number of executive class ticket and economy class ticket to be sold should be respectively. (@) 40,160 (@) 160, 40 (6) 20,180 (i) 180, 20 (©) The maximum profit eamed by airlines is (@) 68000 (©7000 (6) 264000 (2 62000 Sol. G) Since, Aeroplane can carry a maximum of 200 passengers 2 x+H< 200 Option (A) is correct. (i) Since, Airline reserves at least 20 seats for executive class = x30 Also atleast four times as many passengers prefer to travel by economy class than by executive class, > ya4e x+4r€200 0 fox+y< 200) = SxS 200 > 31<40 = x>2Wandx<40 x-axis Option (6) is correct. Linear Programming 177(itt) Profit on executive class = 400x Profit on executive class = 300y Total profit Z = 400x + 300y Option (0) is correct (iv) We have Z = 400x + 300y which is to be maximise under constraints x+ys200 x<40 x>20,y>0 Here, ABCD in bounded feasible region with comer points A(20, 0), B(40, 0), (40, 160), D(20, 180), Now we evaluate [Link] each corner points, ComerPoint | Z= 400. +300 G0, 0) 3000 B00) 16000 (40, 160) (4000 D(20, 180) fone For maximum profit x= 40, y= 160 Option (a) is correct. (@) Wehave Z=400r + 300y 10 40 + 300 > 160 = 16000 + 48000 = 261000 [+ For maximum profit x= Option (¢) is correct. Eee ols eS In the following questions, a statement of Assertion (A) is followed by a statement of Reason (R). Choose the correct answer oul of the following choices. (a) r b) wo w 178) 1 Both A and R are true and Ris the correct explanation of A. Both A and R are true but R is not the correct explanation of A. Ais true but R is false. A is false and R is also false, Assertion (A): The maximum value of Z bx + 2y $10, is 15, Reason (R) : A feasible region may be bounded or unbounded. Assertion (A): The maximum value of Z =x +3y. Such that 2x + y $20, x +2y $20, x, y20is 30 Reason (R) : The variables that enter into the problem are called decision variables, Assertion (A): Shaded region represented by 2v + 5y>80, x+y 20, x20,y20is x + By, satisfying the conditions x20, y20 and Mathematics-XiI: Term-1Reason (R) : A region ora set of points is said to be convex if the line joining any two of its points lies completely in the region. Answers 1@ 2.) 3. (@) HINTS/SOLUTIONS OF SELECTED MCQS 1. Given objective function Z =3x—4y on putting the corner points, we get Zan =~ 32at (0,8) Option (W) is correct. 2 ALG,0), Zyin=3p+q*0= 3p and, at (1,1), Zu PxItgtL =p “ p=ptg = pq >P Option (His correct. Forany two pont in hs square region 3 aline sigment joining them fence it isa convex set, Option (d) is correct. 4. For any two optimal solution Z,, and Z,, their linear combination also gives optimal solution of LPP. Linear Programming J179ie, Z=AZ,+(1-NZAE [OA gives optimal solution, Option (b) is correct. ae (or ONG, Feasible region is shaded region shown in figure with comer points O(, 0), A(10, 0), (0, 10) 20,0 Z.(10,0) = 40 — maximum Z(0,10) = 30 Option (0) is correct 6 Qwty210 Option (6) is correct. 7. Ifa LPP admits two optimal solutions it has an infinite solution Option (6) is correct. 8. so(rilel=5)=1-5,5) Which is not a convex set Option (6) is correct. 9 Zat(3,4)=3p+4q Z(,5) ~ 54 2(3, 4)= Z(0, 5) =9 3p+4y=5y => 3p=q ep Option () is correct. ies 10. i 180) Mathematics—Xil: Term-1nL Feasible region is shaded region which is shown in the figure with comer points (0, 0), (10, 0), (2.2) ana.o,10) 2,0)=0 (10,0) =10 20 20) _ 20 | 44 _ 80 Apa) Fr F Z (0,10) = 30 — Maximum Zyyye = 30 stained at (0,10). Option (0) is correct. ae} Feasible region is shaded region with corner points (0, 0), (2, 0) and (0, 2) 20,0) =0 22,0) =2 —— maximise (0,2) =2 —— maximise Zax = 2 obtained at (2, 0) and (0, 2) s0 is obtained at any point on line segment joining (2,0) and (0, 2). Option (¢) is carzect. By objective functions of a LPP is a function to be optimised Option (0) is correct: Linear Programming 181om 6. 182| Feasible region is shaced region shown in figure, with corner point (0,0), (0,6), (> 6,0) 20,0) Z(,6)=18 25, 2(5,0) =20 a AsZ hes maximum value 24 at (=, ; : 24 4 So at any line segment joining (22, )and (5,4) ence there are infinitely many points Hence option (is correc. Feasible region is shaded region with comer points (0,0), (50) (40,15) (0,35) .2(0,0) =0 Z(0,35) = 0+35= 35 Option (d) is correct Mathematics-XiI: Term-1Feasible region is shaded region shown in the figure with corer points (0, 0), (4, 0), (4, 3), (2,6) and (0,6). ZQ,6) = 6 +30 = 36-— Maximum Z(0,6) = 30 Maximum value of Z is 36 obtained at 3, Option (H) is correct. 16. Feasible region is shaded region with corner points (0, 0), (2,0) and (0, 2). 2(0,0)=0 Z(2,0)=4 —— maximum 2(0,2)=-2 Zam = 4and obtained at (2, 0) Option (His correct, 17. Since maximum value of Z 1x *by, where a, b> O occurs al both points (2,4) and (4,0) Ziyyg ® 20+4 at (2,4) will be same at (4,0) i, Znye 40+ 0-=-4 at (4,0) = Mtdb=40 = 2224 a=2 :. Option (a) is the correct choice, 18. Given inequality 2x+3y>6 nati Check for origin © (0,0), we have 2x04+3x0>6 0> 6, which is not true. 0,0) does not satisfy the inequality (i) Hence 2x + 3y > 6 is half plane that neither contains the origin nor the points of the line 2x +34 =6. <. Option (b) is the correct choice. 18. Since (2,3) does not satisfy 2x +3y-12< 0as 2x243x3-12=449-12 #0 Linear Programming ]18320. 2. 184| ++ Option (6) is the correct choice. Z =2r+3y 2(3,2) =2%34+3%2 =6+6 =12 Option (c)is correct. Since Z occurs maximum at (15, 15) and (0, 20), therefore, 15p +154 =O,p +209 q Option (@) is correct. Since (0,0) docs not satinfy x4 y > 1 je, OF021 = (0,0) not lie in feasible region represented by x+y > 1 Option (#) is correct. Feasible region for an LPP is always a convex polygon Option (2 is correct Points Yoo (0.0) (4.0) 04) (4.0) Option (¢) is corzect. Comer Point Z=07x+y ) 07x0+0=0 (20,0) 07x40 40228 (30, 20) 07 x30+-20=41 +— Maximum (0,40) 07 x0+40=40 Option (#) is correct. (0,3) salisly the equation 2r+3y < 12 2x0+3X3612 9s12 But (3, 3), (4,3), (0,5) does Option (a) is correct not satisfy 2x-+3y < 12 Feasible region is the sel of points which satisfy all of the given constraints, Option (6) is correct. Objective functions of a LPP is A linear function to be optimised. Option (c) is correct. Mathematics-XiI: Term-1