? 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 is used in determining optimum combination of several variables subject to certain constraints or restrictions. ear Programmin; 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: (@) What are the unknowns (variables)? () What is the objective? (0) What are the restrictions? For this, let 2, 2%) smutty be the variables. Let the objective function to be optimized (ie., minimised or maximised) be given by Z. (22014, + 0% +--+ Gy Xp Where 6x; (f= 1,2, -n) are constraints. (ii) Let there be mm constants and let A be a set of constants such that 43) iS) a | n | ©) ze) fal c& fal x ® inal A 2 4X ve Bay By (S, = OF 2) gy yy + ss gy By (S, = OF 2) by gg Xp # yg Xp es + gg Fy (S, = OF 2) By (iii) Finally, let x, 2 0, £52 0, smutty 2 0, called non-negative constraints. The problem of determining the values Of Xp X37 smu Sy Which makes Z, a minimum or maximum and which satisfies (i) and (ii) is called the general linear programming problem. 4. General LPP: (a) Decision variables: The variables x, 22, %3 decision variables. tq whose values are to be decided, are called(©) Objective function: The linear function Z = ¢, X1 + 6) ¥) + wu + 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 (fi), are called the structural constraints of the general linear programming problem. The structural constraints are generally in the form of inequalities of > type or < type, but occasionally, a structural constraint may be in the form of an equation, (@ Non-negative constraints: The set of inequalities (i) 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. (/P) Optimum solution: Any feasible solution which optimizes (i¢., 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. (iii) The resources must be in economically quantifiable limited supply. This gives the constraints to LPP. (io) 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 L. At first, feasible region is obtained by plotting the graph of given linear constraints and its commer 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. Ifthe feasible region is bounded, then M and m are the maximum and minimum values of Z. Case II: 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 are obtained. Case I: If there is no common point in the half plane determined by ax + by > Mand 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 < mand feasible region, then m is minimum value of Z, otherwise Z has no minimum Case 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 [ae Mis maximum and is Open half plane is determined by minimum value of Z 7 +by>M and ax+by < m obtained. Ifno common point in the half plane Ifno common point in the half plane determined by ax + by >M and feasible determined by ax + by < mand feasible region, then M is maximum value of region, then mis minimum value of Z, Z, otherwise Z has no maximum value, otherwise Z has no minimum value. Multiple Choice Questions Choose and write the correct option in the following questions. 1. The number of feasible solutions of the linear programming problem given as Maximize Z 5x + 30ly subject to constraints: Brty $12,x+2y <10,x>0,y20is [CBSE 2023 (65/3/2)] @1 2 3 (@ infinite 2. The feasible region of a linear programming problem is shown in the figure below : Which of the following are the possible constraints? [CBSE 2023 (65/3/2)] (a) x4 2y24,x4y £3,x20,y20 ()) x+2y <4x4y 53,220,420 (9) x4 2y24.x4y23,x20y20 (@ x+2yeaxty23x<0y <0 3. The objective function Z = ax + by of an LPP has maximum value 42 at (4, 6) and minimum value 19 at (3, 2). Which of the following is true? ICBSE 2023 (65/2/1)] (@) a=9,6=1 ()0=9,b=2 (a5,10. The comer points of the feasible region in the graphical representation of a linear programming problem are (2, 72), (15, 20) and (40, 15). If Z = 18x + 9y be the objective function, then [CBSE 2023 (65/1/1)] (a) Z is maximum at (2, 72), minimum at (15, 20) (b) Zis maximum at (15, 20), minimum at (40, 15) (©) Zis maximum at. (40, 15), minimum at (15, 20) (@) Zis maximum at (40, 15), minimum at (2, 72) The number of corner points of the feasible region determined by the constraints x - y = 0, 2ysx+2,x20,y20is [CBSE 2023 (65/1/1)] (a) 2 3 4 @s5 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 ICBSE (Terme1) 2021-22 (65/1/4)] (a) 21 Ox (14 (@ 35 The number of solutions of the system of inequations x + 2y < 3,3x + 4y 2 12,x 2 0,y2 Lis [CBSE (Term-1) 2021-22 (65/1/4)| @ 0 2 (©) finite (@) infinite The maximum value of Z = 3x + 4y subject to the constraints x>0,y>Oandx+y<1is (CBSE (Term-1) 2021-22 (65/1/4)] (a) 7 wa (3 @ 10 The feasible region of an LPP is given in the following figure: 7 fo. 104) (0.38) Then, the constraints of the LPP are x >0,y>0 and [CBSE (Term-1) 2021-22 (65/1/4)] (a) 2x+y 0. Condition on p and q so that the minimum of Z occurs at (3, 0) and (1, 1) is @ p= @ pat (p= @ p=4 The optimal value of the objective function is attained at the points (a) given by intersection of inequation with y-axis only. (0) given by intersection of inequation with x-axis only. (0) given by comer points of the feasible region. (@) none of these A Linear Programming Problem is as follows: finimize: Z=2x+y Subject to the constraints xE3,x59,yz0 x-y20xtys id The feasible region has [CBSE (Term-1) 2021-22 (65/2/4)] (a) 5 comer points including (0,0) and (9, 5) (b) 5 comer points including (7,7) and (3, 3) (0) Scotner points including (14,0) and @,0) (4) 5.comer points including (3, 6) and (9, 5) The comer points of the feasible region for a LPP are P(0, 5), QU, 5), R4, 2) and S(12, 0). The minimum value of objective function Z= 2x + Sy isat the point [CBSE (Term-1) 2021-22 (65/2/4)] (@ P ®Q (R @s47. ALPPisas follows: Maximize/Minimise objective function Z = 2x-y +5 Subject to constraints ax + dy = 60 x+3y $30 x20y20 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. () Minimum value of 2 is 5. (0) Difference of maximum and minimum value of Zis 35. (@) 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), 063, 5), RG, 0) and Sif, 1 and the objective function Z = ax + 2by where a,b > 0. The condition on aand b such that the maximum Z occurs at Q and Sis [CBSE (Term-1) 2021-22 (65/2/4)] (a) a-5b=0 (6) a-35=0 (©) a-2=0 (@ a-8b=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? (a) 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 20 is (a) 36 0 (© 20 (a) none of these Answers 1. @ 2 3) 40 5. (a) 6. (a) 2@ 8. () 2 10. (¢) 1. 12. (a) 13. (6) 4. 15. (6) 16. (©) 7. 18.) 1. &) 20. (6) Solutions of Selected Multiple Choice Questions 1 We have LPP, Zitag = 15x + 30y Subject to constraints arty si2 “@ x42y<10 i) xy20 ii)On plotting (i, (i) and (ii), we have required region (shaded) as OABCO. 5 natin cc alt 38 Points of intersection of (f) and (i), is a2, ) Comer points | Z= 15% + 10y 00,0) 0 At,0) ry (8,28) |e @ and, Zein, =19 at (3,2) => (ii) On solving equation (i) and (ii), we have as3andb=5 Option (¢) is correct. 4. Given corner points are (2, 72), (15, 20) and (40, 15) for the objective function = 18x + 9y. Comer Points | Z=18r+9y 2.72) 684 45,20) 450 > Minimum (40,15) 855 > Maximum Thus, Z is maximum at (40, 15) and minimum at (15, 20). <+ Option (¢) is correct. 8. Given constraints: x-y20 ol) Qysxt+2 x-2y+220 (i) xy 20 oti) On plotting (9, (i) and (iii), we have the figure. There are only two comer points O and A. * Option (a) is correct.6. Let given comer points are A(0, 3), B (3, 2), C(0, 5) and Z=11x+7y At AQ, 3), we have, At BG, 2), we have, AtC(0, 5), we have, = Zip = 21 <. Option (a) is correct. 11x0+7x3=21 =11x3+7%2=47 x + 3y=11x0+7x5=35 7. Given inequations, x+2y <3.) Br 4-dy > 12 (i) x20 if) ye (i) After plotting inequations (7) to (io), we get there is no common region. Hence, number of solutions of the system of inequations is 0. * Option (a) is correct. 8. Wehave, Zinax = 38 + dy Subject tox,y > Oand x+y <1 On plotting, we have Comer points | _Z=3x+4y 00,0) ° AQ,0) 3 80,1) 4 <}— Maximum Zag =4 :. Option (b) is correct. 9. Equation of line containing (0, 104) and (52, 0) is given by = -y-W04=-2e > — Be+y=104 Inequation satisfying region is 2r + y < 104Also, equation of line containing points (0, 38) and (76, 0) is given by y-38 381 x-0 %-0 2 Inequation satisfying region is x + 2y = 76. =. Constraints are 2x + y = 104 and x + 2y 5 76. :. Option (6) is correct. > y= > x42y=76 10. Wehave, Zmuay, = 3¢ + 4y Subject to constraints x-ye-Lxs3 and x,y>0 Conerpons | Zemeay] (0,0) 0 | 4G,0) | BB, 4) 25 <1 — Maximum 0,1) 4 | Zax. Option (¢) is correct. 11. Given objective function is Z = 3r—4y, (On putting the comer points, we get Zaxin =~ 32at (0,8) <. Option (b) is correct, 13. At@,0), Z,,,=3p+qx0=3p and, at (1,1), Zpiq = PX1+Q+1= pq Spap+q = pet Option (6) 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 Zamt Sy P05) 3 as) | 7 R(@,2) 18 <—}-Minimum 2,0) m4 ‘The minimum value of Z is 18 at R (4,2). * Option (¢) is correct. 1” Comer Points | Objective Function Zate-y45 ‘A(0,10) $< Minimum B12, 6) 2 C200 | 25 <1 Maximum ooo | 3 Minimum value of Z is -5 at A (0, 10), Option (b) is correct. 18. We have objective function Z = ax + 2hy has maximum value at Q (3, 5) and $ (4, 1). Z3,5)=Z(@1) ie, 30+ 106 = 40 + 2b = 0=40+2b-3a-10b = 0=0-8 ie,a-8b=0 Option (d) is correct. 19, Weare given objective function Z = 4x + 3y with corner points O, P, Q, R. ‘Comer Points | Objective Function Z=4x+3y 00,0) 0 (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 Rare true but R is not the correct explanation for A. (© Ais true but Ris false. @ Ais false but Ris true,1. Assertion(A) : The maximum value of Z = 5x + 3y, satisfying the conditions x20, y20and 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, y>0 is 30. 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 (20,0) \ 1 . 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 Lo 20) 3 @) Solutions of Assertion-Reason Questions 1, We have, comer points (0, 0), 2, 0), (0,5). Zrnas, =5*0+3%5 = 15 at (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 20 20 2. We have, comer points be (0,0), (10,0), (35). 010) 10 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 (@) is correct.Case-based/Data-based Questions Fach 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 constraintsare as shown below. ( Is this feasible region is bounded? (id) Write the number of comer points in the feasible region, (ii) (@) 1€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 ~ 5y then find the minimum value of this objective function. Sol. _(f) Yes the above feasible region is bounded. (i) Number of comer points = 6 (ii) (@) Z= ax + by 2(6,6) = 6a + 66 Also Z(4, 10) = 4a + 106 From question 6a+6b=4a+10b > 2=4b> a=2b OR Gi) ®) 00,0) 1 40,6) | Bea, 1) | <— Minimum ‘Minimum value of Z is ~ 42 at the point B(4, 10).2. Read the following passage and answer the following questions. [A dealet Ramprakash residing in a rural area opens a shop to start his business, He wishes to purchase a number of ceiling fans and table fans. A ceiling fan costs him 2360 and table fan costs 240. (@ If Ramprakash purchases x ceiling fi 2 y table fans. He has space in his store for at most 20 items, than write its constraints. (ii) If he expects to sell ceiling fan at profit of 722 and table fan for a profit of 218, then express the profit Z (in terms of x and y). (ii) (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 (iii) (b) What is the maximum profit of selling all the fans? Sol. (i) From question He has space in store for atmost 20 items. z x+y <20 (ii) Profit on ceiling fans = % 22x Profit on table fans = 18y Z= 2x4 18y (iii) (a) We have (Profit) Z = 22x + 18y, which is to be maximized under constraints 3x42y < 48 x+y 520 x,y ® O[-> Number of fans can never be negative]Here, OABC is a feasible region, which is bounded. The co-ordinates of comer points are O(0, 0), A(16, 0), B(8, 12) and C(O, 20). Now, we evaluate Z(profit) at each corner point. Corner Point Z=22x+ 18y (0,0) 0 A(16,0) 352 B(8, 12) 392 <—_____ Maximum (0,20) 360 Hence, maximum profit is for =No. of ceiling fans =8 No. of table fans = 12 OR Obviously, from table made above (ii) (&) The maximum value of profit Z is %392, 3. Read the following passage and answer the following questions. [A share is 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 £12,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 € vin 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. (ii) To maximise the interest on both types of share, find the invested amount on both shares Aand B. Sol. (A) Since, she has to invest at least 22000 in share A. f > 2000 Since, she has to invest atleast %4000 in share B. y> 4000 8 Interest on share A = x% 755 10 Interest on share B= y x75,sated rains 2% Hence, LPP is given by Maximise 2, subjetto x20, y20 (i) Wehave 2=(2-+ dh)which i tobe maximised under constrains x 22000 y > 4000 and x + y 12000 x is 11000- == 2000 PERE PERS ES Here, ABC be bounded feasible region with comer points A (2000, 10000), B (8000, 4000), € (2000, 4000). Now we evaluate Z at each corner points. Corner Point ‘A (2000, 10000) 1160 B (8000, 4000) 1040 € 2000, 4000) 560 ie. for maximum interest x = 2000, y = 710000.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. What is the maximum value of objective function Z = 3x + y under given feasible region? Corner Points 0) ao (35) @1 3x + y attains maximum value at (1, 0). =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.y sai Short Answer Questions 1. Minimise Z = 13x -15y subject to the constraints x + y <7, 2x-3y + 620,x>0and y>0. INCERT Exemplar] Sol. Minimise Z=13x-15y ~) Subject to the constraints xtys7 (ii) 2r-3y +620 (iii) x20,y20 (io) 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| Zax 15y 00,0) 0 AO) a1 BGA) 21 €@,2 30 <<} Minimum 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 comer points A (4,0), B (2, 1) and C3). [> x+2ys4andx+y=3 > y=landx=2] Also, we have Z=4r+y Zaaety 16 3 <}-Minimum 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).Sol. Sol. Sol. Maximize: Z = 80x + 120y Subject to the constraints: 3x+4y < 60,x+3y < 30,x,y > 0. Objective function, Z = 80x +120y ..(i) We have to maximize Z, subject to the constraints = 3x+4y<60 (ii) x+3y<30 (ii) *20,y20 (iv) E 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). -*" . x Now the value of objective obiained at comer points as unction is ‘Comer points 0,0) 0 A (20,0) 1600 B(12,6) 1680 <4} Maximum €(0,10) 1200 Zhas maximum value 1680 at (12, 6). Maximize: Z = 100x + 120y Subject to: 5x + 8y < 200, 5x +4y < 120,x,y > 0. Maximize Z=100r+120y 4) - Subjectto 5x + 8y < 200 4) Sr +4y 120 ii) xy>0 Ai) Plotting the constraints Feasible region is shaded region with corner points (0,0), (24,0), (8, 20), and (0, 25). Value of Z=100x+120y At@,0), At (0,25) ‘At (24, 0) At (20) Z=3200 <—— Maximum Maximum value of Z is 3200 at point @, 20). Solve the following linear programming problem graphically : Maximum Z = 3x +9y Subject to the constraints x + y > 10, x + 3y < 60,x 0,y>0. [CBSE 2023 (65/3/2)] We have, Zug, = 3x4 9 Subject to the constraints x+y210 @x+3ys60 Ai) xsy > y-x20 AG) yal () From (1), we have equation x + y = 10, check at (0, 0) for x +2 10, 0 > 10, false. 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 (ii), we have equation x = y, check at (0, 0) for xy, 0.$0, false. 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, CG,5). Also, on solving x4 3y=60 y-x=0 DUS, 15) A(,20) 180 ‘Maximum (0,10) 90 6,5) o DS, 15) 180 Maximum Zy4ax = 180 at infinitely many points lying on the line joining points (0, 20) and (15, 15). 6. Solve the following linear programming problem graphically: = 5x +10y subject to constraint Sol. Objective function Z=5x+loy Subject to constraints x+2y = 120 xty 260 x-2y20 xy20 Minimize: +2y 5 120,24 y 2 60,x-2y20,x20,y20. [CBSE 2023 (65/2/1)]Sol. From (i), equation is x + 2y = 120,check x + 2y $ 120 at (0, 0) o | 20 05 120true oo [| 0 -- Region towards origin. From (ii), equation isx+y kx ty 2 60 at (0,0) o | w 02 60 false 60 | 0 | -. Region away from origin. From (if), equation is x-2y = 0, check at (60, 0),x-2y = 0 0 2 60 = O true 0 i +. Region towards point B. Points of intersection of x + y = 60 and x~2y = is A (40, 20) and point of intersection of x + 2y = 120 and x - 2y = 0 is D(60,30). mk Corner Points (Z=5x+10y A(40,20) 400 (60,0) 300 <}— Minimum C020, 0) 600 (60,30) 600 Zryin, = 300 at (60, 0) Solve graphically the following linear programming proble Maximise Z = 6x + 3y, subject to the constraints x+y 2 80, 3x4 2y < 150, x4 Sy = 115, x20y20. Zipax, = 6% + 3Y Subject to the constraints 4x+y > 80 3x+2y < 150 x+5y > 115 xy 20 [CBSE 2023 (65/1/1)]Equation for (i), we have det y=80 20 | Check at (0,0) for 4x +y = 80, 0 = 80, false. ° 80 0 | =. Region away from origin. Equation for (fi, we have 3x + 2y = 150 50] Check at (0,0) for 3x +2y < 150,0 < 150, true. 0 B 0 | =. Region is towards the origin. Equation for (iti), we have x4 5y=115 Check at 0, 0) for x + 5y 2 115, false. Ble 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 + 24 On solving equation 4x + y = 80 and 3x + 2y = Now, we have A (15, 20) 8 40,15) (2,72) 150 and x + 5y = 115, we get corner point B(40, 15) 50, we get comer point C(2, 72). <1} — Maximum Zayas, = 285 at B(40, 15) 8 Maximize: Z=300x + 190y Subject to constraints: x+y <24,x+ Py <16,x,y 20, Sol. LPPis Maximize Subject to constraints Z=300x + 190y @ xtys2d (ii)4 r+ Sy £16 (ii) x20,y20 (io) 56.16) Feasible region is shaded region with corner points 0(0, 0), A(0, 24), B(8, 16), C(16, 0). ‘Comer Points Z=300x + 1909 00,0) 0 (0, 24) 4560 BG 16) 5440 | a6, 0) 4800 Z is maximum at (8, 16) and maximum value is 5440, 9. Maximize: Z = 5x+ 8y Subject to the constraints: x+ys5,x<4y22x,y 20. Sol. Here, Z = 5x + 8y which is objective function and is to be maximised subjected to following constraints xeys5 @ x4 (ii) y22 (i x20,y20 .- (i) In this case, constraint (j) is a line passing through the feasible region determined by constraints (ii), Git) and (io)