2 Linear Programming POINTS TO REMEMBER 1. Definition: Linear programming (LP) is an optimisation technique in which a linear function is optimised (ie., minimised or maximised) subject to certain constraints which are in the form of linear inequalities or/and equations. The function to be optimised is called objective function. 2. Applications of Linear Programming: Linear programming is used in determining optimum combination of several variables subject to certain constraints or restrictions. 3. Formation of Linear Programming Problem (LPP): The basic problem in the formulation of a linear programming problem is to set-up some mathematical model. This can be done by asking, the following questions: (a) What are the unknowns (variables)? (b) What is the objective? (©) What are the restrictions? For this, let x,y, X37 nent, be the variables. Let the objective function to be optimized (ie., minimised or maximised) be given by Z. (Ze 0, + yt ane + Gy My Where 6); (F=1, 2, are constraints. (ii) Let there be mn constants and let A be a set of constants such that 2) by 2) by = je Po aa iV) 4 © v8] ul x fal Ss 16] al a yy Xp yy Xp + oes + ay a (S yy Xy + 9 Xy + oes + yg By (S Oy £4 + gg Ba + os + gy Hg (S; = OF 2) By (iii) Finally, let x, 2 0, X2 2 0, nme, 2 0, called non-negative constraints. The problem of determining the values of x,y, semny %q Which makes Z, a minimum or maximum and which satisfies (i) and (iii) is called the general linear programming problem. 4. General LPP: (a) Decision variables: The variables x, X2,X3, decision variables. rx Whose values are to be decided, are called(b) Objective function: The linear function Z = ¢, x, + CX + nue + Cy %q Which is to be optimized (maximised or minimised) is called the objective function or preference function of the general linear programming problem. (©) Structural constraints: The inequalities given in (i), are called the structural constraints of the general linear programming problem. The structural constraints are generally in the form of inequalities of 2 type or < type, but occasionally, a structural constraint may be in the form of an equation. (a) Non-negative constraints: The set of inequalities (ii) is usually known as the set of non-negative constraints of the general LPP. These constraints imply that the variables x, ..., X, cannot take negative values. (@) Feasible solution: Any solution of a general LPP which satisfies all the constraints, structural and non-negative, of the problem, is called a feasible solution to the general LPP. (f) Optimum solution: Any feasible solution which optimizes (ie., minimises or maximises) the objective function of the LPP is called optimum solution. 5. Requirements for Mathematical Formulation of LPP: Before getting the mathematical form of a linear programming problem, it is important to recognize the problem which can be handled by linear programming problem. For the formulation of a linear programming problem, the problem must satisfy the following requirements: (@ There must be an objective to minimise or maximise something. The objective must be capable of being clearly defined mathematically as a linear function. (i) There must be alternative sources of action so that the problem of selecting the best course of actions may arise. (iif) The resources must be in economically quantifiable limited supply. This gives the constraints to LPP. (jo) The constraints (restrictions) must be capable of being expressed in the form of linear equations or inequalities. 6. Solving Linear Programming Problem: To solve linear programming problems, Corner Point ‘Method is adopted. Under this method following steps are performed: Step I. At first, feasible region is obtained by plotting the graph of given linear constraints and its comer points are obtained by solving the two equations of the lines intersecting at that point. ‘Step II. The value of objective function Z = ax + by is obtained for each corner point by putting its xand y-coordinate in place of x and y in Z = ax + by . Let M and m be largest and smallest value of Z respectively. Case I: If the feasible region is bounded, then M and m are the maximum and minimum values of Z. Case Il: If the feasible region is unbounded, then we proceed as follows: Step IIL. The open half plane determined by ax + by > M and ax + by M and feasible region, then M is maximum value of Z, otherwise Z has no maximum value. Case Il: If there is no common point in the half plane determined by ax + by < m and feasible region, then m is minimum value of Z, otherwise Z has no minimum value.Above facts can be represented by arrow diagram as Feasible region (having largest and smallest values M and m of Z=ax +by at corner points) y Sounded) Cietened) Mis maximum and Mis Open half plane is determined by minimum value of Z a +by> M and ax+by < m obtained If no common point in the half plane Ifno common point in the half plane determined by ax + by >M and feasible determined by ax + by 0, Qysx+2,x20,y20is (CBSE 2023 (65/1/1)] @2 3 4 5 If the corner points of the feasible region of an LPP are (0, 3), (3, 2) and (0, 5), then the minimum value of Z = 11x + 7y is [CBSE (Term-1) 2021-22 (65/1/4)] @2 (6) 33 ou @ 35 The number of solutions of the system of inequations x + 2y < 3, 3x + 4y 2 12,x20,y 2 lis [CBSE (Term-1) 2021-22 (65/1/4)] @0 (2 (0 finite (@) infinite The maximum value of Z = 3x + 4y subject to the constraints x20, y>Oand x+y<1is CBSE (Term-1) 2021-22 (65/1/4)) @7 was 3 @ 10 The feasible region of an LPP is given in the following figure: Then, the constraints of the LPP are x>0,y>0 and [CBSE (Term-1) 2021-22 (65/1/4)] (a) 2x+y 0 the maximum value is [CBSE (Term-1) 2021-22 (65/1/4)] @0 4 O23 @ 30nL. 12. 1s “. 16. The feasible region for an LPP is shown below: INCERT Exemplar, CBSE 2020 (65/1/4)1 Let Z = 3x—4y be the objective function. Minimum of Z occurs at (a) (0,0) (b) (0,8) © 6,0) (d) (4,10) In an LPP, if the objective function Z = ax + by has the same ma) points of the feasible region, then the number of points of which Zi.q, Occurs is [CBSE 2020 (65/4/1)1 @o 2 (©) finite (infinite yum value on two corner Corner 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=% pt (© p=34 @ p=4 The optimal value of the objective function is attained at the points (a) given by intersection of inequation with y-axis only. (®) given by intersection of inequation with x-axis only. (©) given by corner points of the feasible region. (d) none of these A Linear Programming Problem is as follows: Minimize: Z=2x+y Subject to the constraints x23,x59,y20 x-y20xtysid The feasible region has [CBSE (Term-1) 2021-22 (65/2/4)] (@) 5 comer points including (0,0) and (9,5) _(b) 5 corner points including (7, 7) and (3, 3) (© 5comer points including (14,0) and (9, 0) (d) 5 corner points including (3, 6) and (9, 5) The corner points of the feasible region for a LPP are P(0, 5), Ql1, 5), R, 2) and $(12, 0). The minimum value of objective function Z = 2x + Sy is at the point [CBSE (Term-1) 2021-22 (65/2/4)] @P ®Q OR @s17. ALPPisas follows: Maximize/Minimise objective function Z = 2x-y +5 Subject to constraints ax +4y < 60 x+3y < 30 x20,y20 If the corner points A(0, 10), B(12, 6), C(20, 0) and (0, 0), then which of the following is true. [CBSE (Term-1) 2021-22 (65/2/4)] (@) Maximum value of Z is 40. (6) Minimum value of Z is-5 (0) Difference of maximum and minimum value of Z is 35. (a) Attwo comer points, value of Z are equal. 18. The comer points of the feasible region determined by the set of constraints (linear inequalities) are P(0,5), QG, 5), RG,0) and S(4, 1) and the objective function Z = ax + 2by where a,b > 0. The condition on a and b such that the maximum Z occurs at Q and Sis [CBSE (Term-1) 2021-22 (65/2/4)] (@) a-5b=0 () a-3b=0 (©) a-26=0 (@ a-85=0 19, Foran LPP the objective function is Z = 4x + 3y and the feasible region determined by a set of constraints (linear inequations) is shown in the graph. [CBSE (Term-1) 2021-22 (65/2/4)] Which of the following statements is true? (@) Maximum value of Z is at R. (®) Maximum value of Z is at Q. (©) Value of Z at Ris less than the value at P. (d) The value of Z at Qis less than the value at R. 20. The maximum value of Z = 4x + 3y subject to constraint x+y <10,x,y>0 is (a) 36 40 (920 (@ none of these Answers 1@ 2 3.0) £0 5. (a) &@ 7. (@) 8.) 9. (b) 10. (c) 1.) 2 @ 13. (6) 4. ©) 15. (6) 16. () 17. (6) 18. (d) 19. (0) 20. (6) Solutions of Selected Multiple Choice Questions 1. Wehave LPP, Zax = 15x + 30y Subject to constraints brty<2 “ x+2y<10 i) xy20 iii)On plotting (i, (i) and (iii), we have required region (shaded) as OABCO. 14 18 ) Points of intersection of (i) and (i), is ae, = Corner points | Z=15x+10y 00,0) 0 AG4,0) 0 (28, 8) 73 <}— Maximum C(O, 5) 50 4 Zytux = 78 when x = 5 My 18 5° 5 :. The number of feasible solution is 1 Option (a) is correct 2. As the region is away from origin from the line x + y=3 xty23 Similarly, region is away from origin from the line x + 2y = 4 x+2y24 Also,x20,y20 ++ Option (c) is correct. 3. Given objective function Z = ax + by 3 Zax =42at(4,6) > 4a + 6b = 42 A) and, Zin. = 19 (3,2) > © - 3a + 2b=19 i) On solving equation (i) and (ii), we have a=3andb=5 +: Option (¢) is correct. 4. Given comer points are (2, 72), (15, 20) and (40, 15) for the objective function Z=18x+9y. Comer Points | Z=18r+9y 2,72) 684 (5,20) 450 —}—> Minimum (40,15) 855 —}- > Maximum Its feasible solution is Thus, Z is maximum at (40, 15) and minimum at (15, 20). 2: Option (c) is correct. 5. Given constraints: x-y20 dy sx+2 Sx-2y+220 xy20 x On plotting (i), (ii) and (iii), we have the figure. There are only two corner points O and A. 2+ Option (a) is correct.6. Let given comer points are A(0, 3), B (3,2), C(0, 5) and Z = 11x +7y At A(0, 3), we have, Z=11x0+7x3=21 At BG, 2), we have, Z=11x3+7%x2=47 At C(O, 5), we have, Z = 1x +3y=11x0+7x5 Option (a) is correct. —_ 7. Given inequations,x+2y <3 (i) { 3x 4-4y > 12 ..(4) x20 ii) Hi ss ye (io) ! After plotting inequations (i) to (iv), we get | there is no common region. Hence, number of solutions of the system of inequations is 0. Option (a) is correct. 8. Wehave, i f Zax = 3x + 4y Subject tox,y > Oandx+y <1 On plotting, we have Corer points | Z=3x+4y 00,0) 0 AGL, 0) 3 (0,1) 4 <}— Maximum max = 4 Option (b) is correct. 9. Equation of line containing (0, 104) and (52, 0) is given by y104 0-104 _ -104 ¥-0 52-0 52 104 . I 2e+y=104 ¥ 52 Inequation satisfying region is 2x +y < 104Also, equation of line containing points (0, 38) and (76, 0) is given by y-38_0-38_ 1 = = a -. Inequation satisfying region is x + 2y s 76 Constraints are 2x + y < 104 and x + 2y < 76. - Option (b) is correct. > w-%a-x > x42y 10. Wehave, Zax, =3x+4y Subject to constraints x-ye-xs3 and x,y>0 Comer points | _Z=3x+4y 00,0) 0 AG, 0) 9 BG 4) 3 Maximum |x? 00,1) 4 Zanae, ® 25 -. Option (c) is correct. 11. Given objective function is Z = 3x —4y. (On putting the comer points, we get Zain =~ 32 at (0,8) Option (b) is correct 13. At@,0), Zp, = 3p+qx0=3p and, at (1,1), Zp, = PX1+q+1=p+q Sp=P+9 > 2»=4 > Option (b) is correct From above graph feasible region has 5 comer points including (7, 7) and (3, 3). Option (b) is correct.16. Comer Points | Objective Function Za 2+ 5y P05) 3B Q0.5) a R(s,2) 18 <—-Minimum $(12,0) 24 The minimum value of Z is 18 at R (4, 2). Option (c) is correct. v. Comer Points | Objective Function Za2x-y4+5 A(@,10) 5S <—L Minimum B (12,6) B €(20,0) 25 <—}- Maximum 00.0) 5 Minimum value of Z is -5 at A (0, 10). Option (b) is correct. 18, We have objective function Z = ax + 2by has maximum value at Q (3,5) and S (4,1), 2G,5)=Z(4,1) ie, 4a+2b => 0=4a+2b-3a-10b 2 8b ie,a-8b=0 Option (d) is correct. 19. We are given objective function Z = 4x + 3y with corner points O, P, Q, R. Corner Points | Objective Function Z=4x+3y 00,0) 0 P (0,40) 120 280,20) 180 <—}-Maximum R (40,0) 120 Maximum value of Z is 180 at Q (30, 20) - Option (b) is correct. Assertion-Reason Questions The following questions consist of two statements—Assertion(A) and Reason(R). Answer these questions selecting the appropriate option given below: @ Both A and R are true and R is the correct explanation for A. @®) Both A and R are true but R is not the correct explanation for A. © Ais true but R is false. @ Ais false but Ris true.1. Assertion(A) : The maximum value of Z = 5x + 3y, satisfying the conditions x20, y>0 and 5x + 2y $ 10, is 15. Reason (R) : A feasible region may be bounded or unbounded. 2. Assertion(A) : The maximum value of Z =x + 3y. Such that 2x + y $20, x + 2y $20, x, y20 is30. Reason (R) : The variables that enter into the problem are called decision variables. 3. Assertion(A) : Shaded region represented by 2x + 5y>80, x+y<20, x20,y20is Reason (R) : A region or a 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. a) Solutions of Assertion-Reason Questions 1. We have, comer points (0, 0), 2,0), (0, ). Zmax, =5X0+3%5 =15at (0,5) Clearly, both Assertion (A) and Reason (R) are true but Reason (R) is not the correct explanation of Assertion (A). - Option (b) is correct. 2. Weave, comer points be (0,0), (10,0), (375-2), (0,10) Zinax, =X + 3y =0+3%10 =30 at (0,10) Clearly, both Assertion (A) and Reason (R) are true but Reason (R) is not the correct explanation of Assertion (A). Option (b) is correct. 3. Clearly, Assertion (A) is false and Reason (R) is true Option (A) is correctCase-based/Data-based Questions Each of the following questions are of 4 marks. 1. Read the following passage and answer the following questions. Linear Programming Problem is a method of or finding the optimal values (maximum or minimum) of quantities subject to the constraints when relationship is expressed as a linear equations or linear inequations. ‘The comer points of a feasible region determined by the system of linear constraints are as shown below. (A Is this feasible region is bounded? (ii) Write the number of corner points in the feasible region. (a) If Z = ax + by has maximum value at C (6, 6) and B (4, 10). Find the relationship between a&b. OR (iii) (b) If Z = 2x — Sy then find the minimum value of this objective function. Sol. _(j) Yes the above feasible region is bounded, (ii) Number of comer points = 6 (iit) (@) Z = ax + by Z(6,6) = 64+ 6b Also Z(4, 10) = 4a + 106 From question 6a+6b=4a+10b => 2a=4b=> a=2b OR (i) ©) 00.0) (0,6) 34,10) 066 D648 FO Minimum value of Z is ~ 42 atthe point B(4, 10)2. Read the following passage and answer the following questions. ‘A dealer Ramprakash residing in a rural area opens shop to start his business. He wishes to purchase a number of ceiling fans and table fans. A ceiling fan costs him %360 and table fan costs 8240. (® If Ramprakash purchases x ceiling fans, y table fans. He has space in his store for at most 20 items, than write its constraints. (id) If he expects to sell ceiling fan at profit of 22 and table fan for a profit of 18, then express the profit Z (in terms of x and y). (a) If he sells all the fans that he buys, then write the number x, y of both the type of fans in stock to get maximum profit. OR (ii) (b) What is the maximum profit of selling all the fans? Sol. (i) From question He has space in store for atmost 20 items. x+y $20 (ii) Profit on ceiling fans = & 22x Profit on table fans = % 18y Z= 22x + 18y (iii) (@) We have (Profit) Z = 22x + 18y, which is to be maximized under constraints 3x+2y < 48 x+y s20 x,y 2 O[-- Number of fans can never be negative]Here, OABC is a feasible region, which is bounded. The co-ordinates of corner points are O(0, 0), A(16, 0), B(8, 12) and C(0, 20). Now, we evaluate Z(profit) at each corner point. ‘A(6, 0) BB, 12) C(O, 20) Maximum Hence, maximum profit is for No. of ceiling fans No. of table fans Obviously, from table made above (iii) (&) The maximum value of profit Z is 8392. 3. Read the following passage and answer the following questions. A shareis referred to as a unit of ownership which represents an equal proportion of a company’s capital. A share entities the shareholders to an equal claim on profit and loss of the company. Dr. Ritam wants to invest at most 712,000 in two type of shares A and B. According to the rules, she has to invest at least 22000 in share A and at least 24000 in share B. If the rate of interest on share A is 8% per annum and on share B is 10% per annum. INVEST IN SHARE MARKET. (® If Dr. Ritam invests ® x in share A, and invest & y in share B. If the total interest recieved by Dr. Ritam from both type of shares is represented by Z. Formulate the LPP. (é) To maximise the interest on both types of share, find the invested amount on both shares AandB. Sol. _() Since, she has to invest at least 2000 in share A. x>2000 Since, she has to invest atleast %4000 in share B. y> 4000 Inte hare A= xx Interest on share A = x% 755 10 100 Interest on share B= yxHer total interest = Z =| Hence, LPP is given by Maximise 9400 x20, ¥20 (o Watava a(t anced ar ob <> 2000 y> 4000 and x+y <12000 Here, ABC be bounded feasible region with corner points A (2000, 10000), B (8000, 4000), C (2000, 4000). Now we evaluate Z at each corner points. Comer Point | Zz ‘A (2000, 10000) 1160 <— Maximum B (8000, 4000) 1040 € (2000, 4000) 560 ie, for maximum interest x = 72000, y = 10000.CONCEPTUAL QUESTIONS 1. In figure, which half plane (A) or (B) is the solution of x + y > 1? Justify your answer. Sol. Half plane B because (0, 0) does not satisfy x + y > 1 2. Whatis the maximum value of objective function Z = 3x + y under given feasible region? 0) 0) 3 2 8 33 3 on 1 Sol. 3, Z =3x-+y attains maximum value at (1,0). Z=3x1+0 =3 3. Is feasible region represented by x + y > 1,x > 0, y> 0 bounded? Justify your answer. Sol. No, feasible region obtained is unbounded as shown in figure.1. Minimise Z = 13x -15y subject to the constraints x + y <7, 2x-3y + 620,x20and y>0. INCERT Exemplar] Sol. Minimise Z = 13x- 15: @ Subject to the constraints x+y s7 (i 2x-3y +620 (i) x20y20 (io) 236 #0 Feasible resion is shaded region shown as OABC is bounded and coordinates of its corner points are O(0, 0), A(7, 0), B(3, 4) and C(0, 2) respectively. Comer Points Z=Bx-15y 0,0) 0 AG,0) 1 BG,4) 2 €@,2 -30 Hence, the minimum value of Z is -30 at (0, 2).2. The feasible region for a LPP is shown in the following figure. Evaluate Z = 4x + y at each of the comer points of this region. Find the minimum value of Z, if it exists INCERT Exemplar] Sol. From the fig, itis clear that feasible region is unbounded with the corner points A (4,0), B (2,1) and C(0,3).[ x+2y=dandx+y=3 > y=landx=2] Also, we have Z = 4x+y ‘Comer Points Zaarey Now, we see that 3 is the smallest value of Z at the corner point (0, 3). Note that here we see that, the region is unbounded, therefore 3 may or may not be the minimum value of Z. To decide this issue, we graph the inequality 4x + y <3 and check wether the resulting open half plane has no point in common with feasible region otherwise, Z has no minimum value. From the shown graph, itis clear that there is no point common with feasible region and hence, Z has minimum value 3 at (0,3).x Sol. Sol. Sol. Maximize: Z = 80x + 120y ‘Subject to the constraints: Bx +4y < 60,x+3y < 30,x,y > 0. Objective function, Z = 80x +120y (i) We have to maximize Z, subject to the constraints = 3r44y<60 (i) x+3y<30 (iii) x20,y20 i) The graph of constraints are drawn and feasible region OABC is obtained, which is bounded having corner points O (0,0), A (20,0),B (12, 6) and C (0, 10) Now the value of objective function is obtained at comer points as ‘Comer points 00,0) A (20,0) B(12,6) 1680 9 <}—Maximum C10) 1200 Z has maximum value 1680 at (12, 6). Maximize: Z = 100x + 120y Subject to: 5x + 8y < 200, 5x +4y < 120,x,y > 0. Maximize Z=100x+120y i) Subjectto 5x +8y< 200 Ai) 5x+4y<120 oy xy20 (io) Plotting the constraints Feasible region is shaded region with corner points, (0,0), (24,0), (8, 20), and (0, 25). Valueof Z=100x+120y At (0,0), Z=0 At(0,25) Z=3000 At(24,0) Z=2400 At(8,20) Z=3200 <—— Maximum Maximum value of Z is €3200 at point (8, 20). Solve the following linear programming problem graphically : Maximum Z = 3x +9y Subject to the constraints x + y>10,x+3y < 60,x < y,x20,y20. [CBSE 2023 (65/3/2)1 We have, Zytoc = 34+ 9Y Subject to the constraints x+y210 @Sol. x+3y<60 xsy > y-x20 iii) xy20 fio) From (j), we have equation x +y = 0 10 10 0 - Region away from origin. From (ii), we have equation x + 3y = 60, check at (0, 0) for x + 3y < 60, 0 < 60, true. 0 0 20 0 - Region towards from origin. From (iif), we have equation x 10 2 0 2 :. Region away from (10, 0) On plotting (), (i) and (ii), we have required region (shaded) ABCDA. Points of intersection: On solving x+y=10 y-x=0,we get, C6, 5). 10, check at (0, 0) for x + y> 10, 0> 10, false. 1, check at (0, 0) for x 80 m0) 3x4 2y < 150 x4+5y 2115 xy20 (io) [CBSE 2023 (65/1/1)]Sol. Equation for (i), we have arty =80 0 | 20 | Checkat (0,0) for 4x + y > 80, 0 = 80, false. 8 | 0 | ~. Region away from origin. Equation for (i), we have 3x +2y = 150 0 [50 | Checkat (0,0) for 3x +2y < 150,0 < 150, true. 75 | 0 | -. Region is towards the origin. Equation for (ii), we have x+5y 0 | 115 | Checkat (0,0) for x + 5y = 115, false. 23 | 0 | =. Region away from origin. On solving equation 4x + y = 80 and x + 5y = 115, we get comer point A(15, 20), On solving equation 3x + 2y = 150 and x + Sy = 115, we get comer point B(40, 15). On solving equation 4x + y = 80 and 3x + 2y = 150, we get comer point C(2, 72). Now, we have (15, 20) B (40,15) c@7) Zepan. = 285 at B(40, 15) Maximize: Z = 300x + 190y Subject to constraints: x+y < 24,x4 Ly <16,x,y 20. LPP is Maximize 2 =300x + 190y Subject to constraints x+y <24x+4ysi6 (i) Feasible region is shaded region with corer points O(0, 0), A(0, 24), B(8, 16), C(16, 0) ‘Comer Points Z=300x + 190y (0,0) 0 (0,24) | 4560 BS, 16) | 5440 Maximum 06,0) 4800 Zig maximum at (8, 16) and maximum value is 5440. 9. Maximiz 2 Z= 5x + By Subject to the constraints: x+y=5,x54y 222,420. Sol. Here, Z = 5x + 8y which is objective function and is to be maximised subjected to following constraints xty 0 xsd (ii) y22 (iii) x20,y20 (iv) In this case, constraint (i is a line passing through the feasible region determined by constraints (i, (i and (o).10. Sol. 800.5) 4 rl 3 2 1 A yy + Therefore, maximum or minimum value of objective function ‘Z’ exist on end points of line (constraint) (i) in feasible region ie., at A or B. At A@,2),Z=5x3+8x2=15+16=31 At B(0,5),Z=5x0+8x5=0+ 40 = 40<—Maximum Maximum value of Z is 40 at (0, 5). Maximize: Z = 20x + 10y Subject to constraints: 15x +3y <42,3x+y < 24,x,y 20. Z=20x+ 10y @ We have to maximise Z subject to the constraints: ‘15x + 3y <42 (ti) Br+y<24 (it x, y20 (iv) Graph of x = 0 and Graph of x2 0, y2 is the Ist quadrant. Graph of 15x +3y = 42 = Vis the y-axis and x-axis respectively. x 0 8 y “4 0 Graph for 15x + 3y < 42 Graph of 3x + y= 24 x 0 8 the part of Ist quadrant which contains the origin y 24 0 Graph of 3x + y < 24 is the part of Ist quadrant in which origin lie.Hence, shaded area OACB is the feasible region. 24 are solved as, For coordinate of C, equation 1.5x + 3y = 42 and 3x +4 15x +3y=42 () Br+y=24 (i) 2x(0)-(0i) > 3x+6y=84 3x > => x=4 (Gubstituting y = 12 in (0%) Now, value of objective function Z at each corner of feasible region is, ‘Comer Points| Z=20x+ 10y 0,0) 0 AG,0) 20x8 +10x0= 160 30,14) 200+ 10x14 = 140 (4,12) 20x4+10x12=200 <7— Maximum Maximum value of Z is 200 at (4, 12). 11. Maximize: Z = 22x + 18y Subject to constraints: 3x + 2y < 48,x+y <20,x,y > 0. Sol. We are given LPP Maximise Z = 22x + 18y @ Subject to the constraints: Bx +2y<48 (i) x+ys20 i) xy20 (iv)8 (8, 12) + ‘The region satisfying inequalities (ii) to (iv) is shown (shaded) in the figure. Feasible reagion is shaded region with comer points 0(0, 0), A(16, 0), B(8, 12), C(0, 20). Let us evaluate, Z = 22x + 18y at each corner point Corner Points Z= 2+ 18y 00,0) 0 | (16,0) 352 B(8,12) 392 Maximum C20 360 Thus, maximum value of Z is 392 at B (8, 12). 12. Minimize: Z = 10x + 4y Subject to constraints: 4x+y = 80,2x+y 2 60,x,y 20. Sol Z= 10x +4y “ is objective function, which we have to minimize. Here, constraints are: 4x+y280 (ii) 2+y260 (ii) Also, x,y20 Ai) On plotting graph of above constraints or inequalities (ii, (ii) and (jo), we get shaded region having corner point A, P, B as feasible region."2P(10, 40) For coordinate of P. Point of intersection of 60 () and 80 (vi) @)-@i) => 2e+y-4x-y= 60-80 > x10 > y=40 Coordinate of P = (10, 40) Now the value of Z is evaluated at corner point in the following table Few tom: | net lene Since, feasible region is unbounded. Therefore we have to draw the graph of the inequality. 10x + 4y < 260 (ci) Since, the graph of inequality (vii) does not have any point common. So, the minimum value of Z is 260 at (10, 40).2B. Sol. Maximize: Z = 10500x + 9000y Subject to constraints: x+y < 50,2x+y < 80,x,y > 0. Given Z = 10500x + 9000y G) We have to maximize Z subject to the constraints: x+y<50 oii) ax+ys 80 (i) x20,y20 liv) Table for x + x 0 » | mit. | Table for 2x + y = 80 ™ 1] mle] ‘The graph of system of inequalities (i) to (io) are drawn, which gives feasible region OABC with corner points O (0, 0), A (40, 0), B (30, 20) and C (0, 50). Feasible region is bounded. Now, ‘Corner points ‘Z = 10500x + 9000y | 00,0) 0 | A (40,0) 420000 B (30,20) 495000 <—}—Maximum c@.50) 450000 Maximum value of Z is 495000 at (30, 20).ry Sol. 2 Sol. Long Answer Questions Solve the following Linear Programming Problem graphically: Maximize : P= 70x + 40y subjectto: — 3x+2y<9 Brtys9 x20,y20 [CBSE 2023 (65/5/1)1 We are given LPP Max P = 70x + 40y subject to 3x+2y <9 arty <9 x20 y20 On plotting the Constraints (i, (i), (ii) and (je) we have We have feasible region is shaded region with corner points O(0, 0), A(3, 0), B (0 ‘Comer Points Pe Tore dy 00,0) 0 on) 210 <—}-——Maximum 9 160 (0.3) Maximum value of P is 210 at the point AG, 0). Maximize: Z = 100x + 120y Subject to the constraints: 2x + 3y < 30, 3x+y <17,x,y > 0. Here, — Z=100x + 120y oD) Subjects to constraints: Also 2x+3y < 30 fi)Sol. 3r+y <17 ii) xy 20 (io) On plotting graph of above inequalities (ii), (ii) and (jv). We get shaded region as feasible region having comer points A, O, B and C. For coordinate of ‘C° ‘Two equations (if) and (iii) are solved and we get coordinate of C Now, the value of Z is evaluated at corner points as: ‘Comer points Za or + 120y 00.0) 0 40,10) 1200 ” 1700, 5(F0) 3 cas) 1260 0. Objective function is to maximize Z = 60x + 40y 5x +6y < 45 @ 3x+2y < 18 (i, xyro (i) We plot the graph of inequations shaded region is the feasible solution (i) (i) and (ii) The shaded region in the figure represents the feasible region which is bounded. Let us now evaluate Z at each corner point.Sol. Zat (0,0) is 60x 0+40x0=0 15, 15 Zat (0,5) is60x0+40x > =300 zat (292) is 602 +40 x92 2135 + 225 = 360 <—Maximum at (TD) is 60% +40x 2135+ Zat (6,0) is 60x 6+0= 360 <——Maximum 9 45 Maximum value of Z is 360 obtained at any point on the line segment joining (7, “5") and (6, 0). Maximize: Z = 15x + 10y Subject to the constraints: 2x + y << 40, 2x + 3y < 80,x,y > 0. We have LPP Zagy, = 15 + 10y Subject to constraints 2x+ys40 “i 2x+3y< 80 (ii) x, y20 (iii) ‘The feasible region determined by the system of constraints is OABC. The comer points are, (0, 0), 80 “a A(0, >"), B (10, 20), C20, 0)ae a 00,0) 0 80 800 4(05) 3 (10,20 eee C (20,0) 300 The maximum value of Z = 350 which is attained at B (10, 20). Maximize: Z = 1000x + 500y Subject to the constraints: 3x + 5y < 225, 2x +y < 80,x,y > 0. Sol. LPPis Maximise Z = 1000x + 500y Subjectto, 3x +5y<225; 2x +y<80; x20,y20 From the shaded feasible region, it is clear that coordinates of corner points are (0, 0), (40, 0), (25, 30) and (0, 45). On Solving 3x + 5y = 225 and 2x +y = 80, we get x= \ SOON MOD Eee ee ee \ ¥ Corner Points Z= 100% + 500y @, 0) 0 (40, 0) 40000 8 x+2y = 10 xy 20 [CBSE (F) 2020, (65/3/1)] Given constraints are aty28 x+2y210 and xy 20 For the graph of 2x +> 8, we draw the graph of 2x+y=8 EA rans y 8 0 Now, checking for (0,0) we have 2x0+0>8 = 028 Origin (0, 0) does not satisfy 2x+y>8 Region lies away from origin. For the graph of x+2y > 10, we draw the graph of x+2y=10 E 0 10 y 5 0 Now, checking for origin (0, 0), we have 0+2x0210 = 0210 . Origin (0, 0) does not satisfy x+2y > 10 Region lies away from origin. Now x, y2 0, it means region will lie in first quadrant.Sol. On plotting graph of given inequalities (or constraints) We get the region (shaded) with corner points A (10, 0), B(2, 4) and C(0, 8) Now, the value of Z is evaluated at corner points in the following table. ‘Comer Points Z=5x+7y (10,0) 50 BQ4) 3 <4 Minimum cos 56 Since, feasible region is unbounded. Therefore, we have to draw the graph of the inequality. Sr+7y <38 Since, the graph of this inequality does not have any point common. So, the minimum value of Z is 38 at (2, 4). Hence, Zin = 38 at (2,4). Maximise Z = 8x + 9y subject to the constraints given below : 2x +3y <6; 3x-2y <6; y<1; x, y>0 [CBSE (F) 2015] Objective function is Z = 8x + 9y. Given constraints are 2r+3y <6 3r-2y <6 ysl xy 20 For graph of 2x +3y <6 We draw the graph of 2x + 3y = 6 = 0 3 y 2 0 2x0+3x0 < 6 = (0,0) satisfy the constraints. Hence, feasible region lie towards origin side of line. For graph of 3x-2y < 6 We draw the graph of line 3x -2y = 6. z 0 2 | y 3 o | 3x0-2x0<6 => Origin (0, 0) satisfy 3x -2y <6. Hence, feasible region lie towards origin side of line. For graph of y <1 We draw the graph of line y = 1, which is parallel to x-axis and meet y-axis at 1 0 < 1= feasible region lie towards origin side of y = 1. Also, x 0, y 2 O says feasible region is in Ist quadrant.Therefore, OABCDO is the required feasible region, having corner point O(0, 0), A(0, 1) 3 4) (30,6 (34) (i575), 220. Here, feasible region is bounded. Now the value of objective function Z = 8x + 9y is obtained as. ae Zaere5y 00.0) 0 40.1) ° a a6. 226 <—}—Marimum 13°13 DG, 0) 16 30 Zs maximum when x= yyand y= 3B 8, Minimize and maximize Z = 5x + 2y subject to the following constraints: x-2y<2, 3x+2y<12, -Bx+2y<3, x20,y20 ICBSE Panchkula 2015] Sol. Here, objective function is =5x+2y O} Subject to the constraints x-2y <2 i) 3r42y <12 (ii) 3x+2y <3 io) x2=0y20 0) Graph forx-2y <2 We draw graph of x-2y =2.as ° 2 a 0 0-2x0<2 [By putting x = y = 0 in the equation] ie, (0,0) satisfy (ii) = feasible region lie origin side of line x ~2y = 2. Graph for 3x +2y < 12 We draw the graph of 3x + 2y x 0 4 ¥ 6 0 3x0+2x0<12 [By putting x=y=0 in the given equation] i.e,, (0,0) satisfy (iii) = feasible region lie origin side of line 3x + 2y = 12. Graph for-3x + 2y <3 We draw the graph of 3x + 2y < 3 5 4a y 0 15 -3x0+2x0<3 — [Byputtingx=ive, (0,0) satisfy (iv) = feasible region lie origin side of line 3x + 2y = 3. x2 0,y 20 = feasible region is in Ist quadrant y-axis X-axis Now, we get shaded region having corner points O, A, B, C and D as feasible region. The co-ordinates of O, 4, B, C and D are O(0, 0), A, 0),8(2,3),c(3,22) and 0(02) respectively. Now, we evaluate Z at the comer points. Corner Points Za5x+2y 00,0) ° —— Minimum AGO) 10 <—}— Maximum Hence, Z is minimum at also Z is maximum at x=(olV cides com arta} 1 Objective Type Questions 1. Choose and write the correct option in each of the following questions. (#) Feasible region (shaded) for a LPP is shown in the given figure. Minimum of Z = 4x +3y occurs at the point. @ (0,8) (6) (2,5) © @,3) @ (9,0) (ii) The solution set of the inequation 3x + 2y > 3 is (@ half plane not containing the origin _(b) half plane containing the origin. (©) the point being on the line 3x + 2y=3 (d) None of these (iii) If the constraints in a linear programming problem are changed (@) solution is not defined (®) the objective function has to be modified (©) the problems is to be re-evaluated _(d) none of these (jv) Which of the following statement is correct? (@) Every LPP admits an optimal solution. (b) Every LPP admits unique optimal solution. (©) Ifa LPP gives two optimal solutions it has infinite number of solutions. (@ None of these (©) The maximum value of p = x+3y such that 2x+y <20, x+2y<20, x20, y20 is @ 10 (6) 30 (60 @ 2 © Conceptual Questions 2. Determine the maximum value of Z = 3x +4y, Subject to the constraints: x+y <1,x20,y20. 3. Ifalinear programming problem is Z,,,, = 3x +2y, Subject to the constraints: x+y <2, find Z,,,.- 4. Maximise the function Z = 11x+7y, subject to the constraints: x <3, y<2,x>0,y>0.1 Short Answer Questions 5. Solve the linear inequation ~3x +2y > 6 graphically. 6. What is the maximum value of objective function Z = 3x + y under given feasible region? y M2) = 2 2ety=2 7. In figure, which half plane (A) or (B) is the solution of x + y > 1? Justify your answer. y 1 ® 2 ae y Maximize Z = 6x + 16y subject to constraints x + y 2 2,x,y 20. Find the maximum value of (2,7), (5,4) and (6, 0). 10. Let Z = ax + by has optimal value at two points (2, 3) and (5, 7), then derive the relationship between a and b. 3x + 2y where comer points of feasible region are (0, 0), (0,8), 11. Determine the maximum value of Z = 3 + 4y of the feasible region (shaded) for a LPP is shown in figure.2, In figure, the feasible region (shaded) for a LPP is shown. Determine the maximum and minimum value of Z = x + 2y. = Long Answer Questions 13, 14. 15, 16. 7. 18, Solve the following linear programming problem graphically: Minimise Z = x-5y+20 Subject to constraints: x—y>0,-x+2y>2; x23yS4x,y20 Solve the following LPP: Maximise Z=5x+7xy Subject to constraints: x, +, <4, 3x, + 8x, < 24, 10x, +7x, < 35, ty %20 Maximise Z=x+y subject to x+4y <8, 2x+3y <12,3r+y <9,x>0,y>0. Solve the following LPP graphically: Maximise 1000x + 600y Subject to the constraints x+y $200 x220 y-4r20 xy20 [CBSE (F) 2017) Solve the following LPP graphically: Maximise Z=4xty Subject to following constraints x+y <50, 3x+y<90, x>10, xy>0 [CBSE Dethi 2017] Solve the following linear programming problem graphically: Maximise Z=7x+10y Subject to constraints 4x + 6y $240 6x+3y S240 x210 x20,y20 [CBSE (AD 2017]19. Find graphically, the maximum value of Z= 2x+5y, subject to constraints given below: 2+4y <8, 3xt+y <6, xt+y<4, x20,y20 [CBSE Dethi 2015] 20. Solve the following linear programming problem graphically. Minimise Z=3x+5y Subject to the constraints: x+2y210; x+y 26; 3x+y>8; x,y20 [CBSE Ajmer 2015] 2. Maximize Z=x+y Subject to the constraints pe eeiy as tysha1=0 22, Maximize Z = 45000x + 5000y Subject to constraints x+y < 250, 5x +8y < 1400,x,y 20 23. Maximize Z=O.7x+y Subject to constraints 2x+3y < 120, 2x+y < 80, xy 20. 24, Maximize Z = 1000x + 600y Subject to constraints x+y < 200, x 220, y-4x 20, xy 20 panwers 100 §@@ (i) © (i) © ow 24 3.6 447 5. y 63 7, Half lane B because (0,0) does not satisfy x +y>1 f0.3) -\V ome ‘ a2 9.23 10. 30+ 4b=0 11. 196 12. Maximum= 9, minimum = <8,.2, tt 5, (2 5 13. At (4,4), Zin y= $x- EZ 15. Bat (FF) 16. Zipy, = 136000 at x = 40 and y= 160 17. Zygg = 120 when x = 30, y= 0 18. Zag = 410 for x = 30, y = 20 19, Maximum value of Zis 10 at x 20, Minimum value of Z is 26 at (2, 4). a. saat (4,2) 22. 11250000 at (250, 0) 23. 41 at (30, 20) 24. 1, 36,000 at (40, 160)