CHAPTER 1 2 Linear Programming \Y/ bre ese seated chert se rar ieee equations and their use in real life problems. We have also learnt about linear inequations (inequalities) in two variables and their solution by graphical method. The technique of solving a system of linear equations may be fayplied to salve ‘scxmas pridileras/st day lvclag lsfaTes brat and economic activities, we come across problems which require the best allocation of available limited resources so that the cost is minimised or profit is maximised. Thus when ia limited Gasceeeaie a cantly qroarecncn tg Ghareee TOPIC is required to optimize (maximise or minimise) a linear profit/ > Linear Programming Problem cost function whose variables are restricted to values satisfying a system of linear constraints (a set of linear equations or inequations). The term ‘programming’ means planning and it refers to a particular plan of action from amongst several alternatives for maximising profit or minimising cost etc. ‘The term ‘linear’ means that all inequations or equations used and the function to he maximised or minimised are linear. Linear programming problems are now widely used in management, commerce, science Use of Linear Programming Ina military operation, the effort isto inflict maximum damage to enemy at minimum cost and loss. The industrialist would like to have unlimited profits, but he is constrained by limited manpower, capital and market demand. A salaried person tries to make investments in such a manner that the returns on investment are high but at the same time income tax liability isalso kept low. TOPIC : LINEAR PROGRAMMING PROBLEM Linear Programming Linear programming is an optimisation technique in which a Linear function is optimised (je, maximised or minimised) ‘subject to certain restrictions which are in the form of linear inequalities.518 wetG | OOPERCENT Mathematics Class-12 Linear Programming Problem (LPP) - A linear programming problem (LPP) is a problem that is concerned with finding the optimal value of a linear function ‘subject to given constraints. General Form of a LPP ‘The general form of a linear programming problem is Optimize (Maximise or Minimise) Z = c,x, + ¢3%3 + constraints, uh * 4+ AX t nh > 1 Ayah * Ayaka + Terms Related to LPP ‘Optimization problem : A problem in which a linear function isto be optimised (maximised or minimised) satisfying certain linear inequalities is called an optimization problem. Objective Function Uh cy Cqroeny Gy ae constants and 2, yt, ate variables, then the linear function Z = ¢%, + 3%) + son + 64x, which is to ‘be maximised is called the objective function. The objective function describes the primary purpose of the formulation of a linear programming problem and itis always non-negative. In business applications, the profit function which is to be ‘maximised or the cost function which isto be minimised is called the objective function. Decision Variables : The variables that enter into the problem are called decision variables. Constraints : The inequations or equations in the variables of a LPP which describe the conditions under which the ‘optimisation (maximisation or minimisation) is tobe accomplished are called constraints. In the constraints given in the general form of a LPP there may be any one ofthe three signs , Inequations in the form of greater than (or less than) indicate that the total use of the resources must be more than (or less than) the specified amount whereas equations in the constraints indicate that the resources described are to be fully used. Non-negative Restrictions : The values of the variables x2... , in an LPP are always non-negative (2 0). Thus, 24 20,2320, ory 220 Solution of LPP Asset of values of variables %, 2, mont i called a solution of a LPP, if it satisfies the constraints of the LPP. Terms related to the solution of LPP Feasible Region : The common region determined by all the constraints and non-negative restrictions of an LPP is called the feasible region. The feasible region may be either bounded or unbounded. @) Bounded feasible region : If the feasible region is enclosed within a circle, then it is called bounded feasible Tegion. (ii) Unbounded feasible region : Ifthe feasible region can be extended indefinitely in any direction, then feasible region is called unbounded. Feasible Solution : The set of points, within or on the boundary of the feasible region is said to be the feasible solution. Infeasible Region : The region other than the feasible region is called infeasible region of the LPP. Infeasible Solution : Any point outside the feasible region is called infeasible solution. Thus a solution of LPP is an infeasible solution, ifthe system of constraints has no point which satisfies all the constraints and non-negative restrictions. Comer Point of a feasible Region : A point in the feasible region which isthe intersection of two boundary lines is called corner point. Orie ‘value of an objective function : The maximum or minimum value of an objective function is called its optimal value, ‘Optimal Feasible Solution : A feasible solution of LPP which maximises or minimises the objective function, is called its optimal solution. Optimal value of an Objective Function : The optimal (maximum or minimum) value of the objective function is obtained ata vertex of the feasible region (if itis bounded). If there are more than one points (vertices) where the objective function is optimum (maximum or minimum), then every point on the line segment joining any two such vertices optimizes the objective function. + 6%, Subject to + mei (S20, + ay (S*2)b, + AyinhalSs "12 Ng Xyp Epon X20Linear Programming 519 Note: An LPP may have many optimal solutions. Infact, if an LPP has two optimal solutions, then there are infinite number ‘of optimal solutions which are the points on the line segment joining two solutions which optimizes the objective function. Redundant Constraint; If any constraint does not intersect the feasible region, then the constraint is called redundant constraint Convex Set : A set is a convex set, if every point on the line segment joining any two points in it lies init. Convex Polygon : If the feasible region is closed, itis in the form of a polygon. It is called as convex polygon. Note : () If the feasible region of an LPP isa convex polygon, then the problem has an optimum solution and it lies on at least cone of the vertices (corners) of the polygon. {ii) The set of all feasible solution of a LPP is a convex set. Some Important Theorems of LPP ‘Theorem 1 : Let R be the feasible region for a linear programming problem and let Z = ax + by be the objective function. When Z has an optimal (maximum or minimum) value, where the variables x and y are subject to constraints described by linear inequalities, the optimal value must occur at a corner point of the feasible region. ‘Theorem 2: Let R be the feasible region for a linear programming problem and let_Z = ax + by be the objective function. If R is bounded, then the objective function Z has both maximum and minimum value on R and each of these occurs at a corner int of R, Remeck : if is unbounded, en a cnxmnien or 9 mbaisien valu of the objective fnation may net ext: However tit exists, it must occur at a comer point of R. Graphical Methods of Solving LPP There are two graphical methods for the solution of linear programming problems. These methods are suitable for solving, linear programming problems containing two variables only. If a LPP contains more than two variables, these graphical methods are not suitable to solve them. Such type of problems are solved by simplex method which is beyond the scope of our discussion, We shall, therefore, be concerned only with the graphical methods involving two variables x and y. The following methods are used to solve linear programming problems graphically : (@ Corner-Point Method (ii) Iso-profit or iso-cost method. Corner Point Method The method comprises of the following steps. Step! y= Din it and obtain a point on x-axis. Similarly, by putting x = 0 obtain a point on y-axis. Join these two point to obtain the graph representing the equation. Step III : Determine the region represented by each inequation. To determine the region represented by an inequation replace x and y both by zero, if the inequation reduces to a valid statement, then the region containing the origin is the region represented by the given inequation. otherwise, the region not containing the origin is the region represented by the given inequation. Step IV : Obtain the region in xy-plane containing all points that simultaneously satisfy all constraints including non-negative restrictions. The polygonals region so obtained is the feasible region and is known as the convex polygon of the set of all feasible solutions of the LPP. Step V : Determine the coordinates of the vertices (comer points) of the polygon representing the feasible region by solving, the equations of lines taken two at a time, Step VI: Determine the value of the objective function Z at each comer point. Also, find the least value m and greatest value Mof the values of objective functions at comer points. Step VIL: If the feasible region R is bounded, then M and m will be the maximum and minimum values respectively of Z. Step VIII : Ifthe feasible region R is unbounded, then () Draw the line ax + by = M and find the open half plane ax + by > M. If the open half-plane represented by ax + by > M has no point common with the unbounded feasible region, then M is the maximum value of Z. Otherwise Z has no maximum value. (ii) Draw the line ax + by = m and find the open half plane represented by ax + by 0 isan open half-plane, For example, the graph of 2x + 3y -2> 0 is an open half-plane @)_Closed half-plane : A half-plane inthe xy-plane is called a closed half-plane ifthe points on the line separating the half- planes are also included in the half-plane, The graph of a linear inequation of the form ax + by +.¢O or ax + by + ¢2 Owill be a closed half-plane For example, the graph of ~ y +220 is aclosed half-plane. Note : In an LPP, if the objective function Z = ax + by has the same maximum value on the two comer points of the feasible region, then the number of points at which Z,,,, occurs i infinite. Iso profit or iso-cost Method (1)_Iso-profit or Iso-cost method : The objective function Z is a linear function in x and y. Hence, for any particular value of Z, the graph of objective function Z = ax + by isa straight line and as the value of Z varies, a family of parallel lines is generated. Let P(r, y,) be a point inthe plane. Substituting x=, and y= yin the objective function Z= ax + ky, we get 2, = ax, + by, Now consider the line ax + by = Z,, This line is referred to as the initial objective line. If the objective function is of maximisation type, then this inital objective line Z, = ax + by is called iso-profit line. If the objective function is of minimisation type, then this initial objective line Z, = ax + by is called iso-cost line. ‘The method comprises of the following steps. Step I: Formulate the given LPP in mathematical form, ifit isnot given so. Step II: Obtain the region in xy-plane containing all points that simultaneously satisfy all constraints including non-negative restrictions. The polygonal region so obtained isthe convex set of all feasible solutions of the given LPP and itis also known as the feasible region ‘Step HII: Determine the coordinates ofthe vertices (corner points) ofthe feasible region obtained in step II. Step IV : Give some convenient value of Z and draw the line so obtained in xy-plane. Step V If the objective function is of maximisation type, then draw lines parallel tothe line in step IV and obtain a line which is farthest from the origin and has at least one point common to the feasible region. If the objective function is of minimisation type, then draw lines parallel to the line in step IV and obtain a line which is nearest to the origin and has at least one point common tothe feasible region. ‘Step VI: Find the coordinates of the common point(s) obtained in step V. The point(s) so obtained determined the optimal solution(s) and the value(s) ofthe objective function at these point(s) give the optimal solution Advantages of Linear Programming : (Choosing the media mix (radio, TV, newspapers, hoardings, magazines, internet) maximise the advertising effectiveness, within given publicity budget. (ii) Determining shortest routes for travelling salesmen. (iil) Helping a farmer decide best crop mix so as to minimise risk and maximise profit. Thus, the linear programming helps in (@)_ choosing the best alternative amongst a set of allernatives so that profit is maximised or cost is minimised. (©) taking into consideration not only intemal factors like manpower, machine, budget, storage availability etc. but also ‘external factors like market demand, purchasing power of the customer etc (0) indentifying bottlenecks in the production process. () choosing best production policy and inventory policy so that seasonal fluctuations in demand can be handled. Limitations of Linear Programming : (i) _Itdeals with optimizing a single objective. In practice, a number of objectives may be there. (ii) The assumption that input and output variables are directly proportional is not strictly true. “Economies of scale” usually ensure that the more you produce, lesser is the average cost. (iil) The linearity of variables assumes that resources required for multiple activities are sum total of resources required for individual activities. However, synergies of product mix usually mean that the requirement is less than the sum. (iv) In practice, many decision variables assume integral values, ¢g., number of workers linear programing deals with variables having continuous values.DMA. Sasi Linear Programming . © Solve the followin: 521 Seige, following linear programming problems Minimise Z = 5x + Ty Subject to the constraints Qr+y28 x+2y210 xy20 (2020) Sol. We have, minimise Z = 5x + 7y ‘Subject to constraints, 2x +y28,x+2y210,x,y20 To solve LPP graphically, we convert inequations into ‘equations, Let, +y=8,l,:x+2y=10andx=0,y=0 Solving /, and I, we get E(2, 4) Let us draw the graph ofthese equations as shown b Sx s7y=38 ‘The comer points of the feasible region are D(0, 8), B(10, 0) and E(2, 4). The value of the objective function at these points are: Comer points | __ Value of 2= 5x +7y PIO) 36 B (10, 0) 50 EQ) 35 (Minimum) From the table, we find that 38 is the minimum value of Z at E(2, 4). Since the region is unbounded, so we draw the graph of inequality 5x + 7y < 38 to check whether the resulting open half plane has any point common with the feasible region. Since it has no point in common. So, the minimum value of Z is obtained at E(2, 4) and the minimum value of Z = 38. Solve the linear programming problem graphically : Maximise Z= 8+ 9y, subject to the constraints given below : 2x + By $6, Sx 2y <6, y<1;x,920 Sol. Let |, : 2x + 3y = 6 bs 3x - 2y = 6 by x=0,y=0 We have, Z = 8x + 9y Subject to constraints 2x+3yS6;3r~2ys6;yS1ixy20 To solve LPP graphically, we convert inequations into equation. Solving I, and ly we get D (15,1) Solving! and, we get ¢(22,5.) ‘The graph of these equations as shown above. Shaded portion OADCB is the feasible region, where coordinates of the comer points are O(0, 0), A(,1), D(L5, 1), c(2 <).50. 0. ‘The value of the objective function at these points are: ComerPoints| Value of Z= 8x + 9y O00) 3x0+9x0=0 A@1) 8x0+9x1=9 Da51) $x15+9x1=21 <8) B'S Bo) 3x29 90=16 From the table, the maximum value of Z is 226, which 30 6 is attained at the point C(32, 5) Solve the following linear programming problem graphically : ‘Maximise and Minimise Z = ax + 5y Subject to constraints : Qx-y+220; 2x4 3y- 1220; Maximise and Minimise Z= 3x +5y subject to 3x - dy 2-12; 2x - y2-BIx+ y2IBxs4;y22x20 Converting the inequations into equations, we obtain the following equations, 3x - 4y = - 12, 2x-y=-2, 2e+3y=12.x=4,y=2andx= ‘The shaded portion ABCDE shown in figure represents the feasible region of the given LPP. Y522 “The values ofthe objective function at these given in the following able: eer ComerPoints[ Value of Z= 3:5) AGB.2)_ [Z=3"3+5x2=19 Minimum) 54.2) Za3xd+205=D C4, 6) Z=3%4+5%6=42 (Maximum) 02 2=3x345x2—2 aang From the table, the maximum value of Zi @, which is ‘attained at C(4, 6) and the minimum value of Z is 19, which is attained at AG, 2) © Solve the following linear programming problem graphically Maximise Z = x + 2y, ‘Subject to the constraints : X-y20,29Sx+2, 5920. Sol. Wehave Maximum Z=x+2y ‘Subject to the constraints : x-y20;2ysx+2;x,y20 ‘To solve LPP graphically, we convert inequation into ‘equations. Let l,:x-y=0;1,:2y=x+2;x=0,y=0 Solving I, and l;, we get A@2). Letus draw the graph ofthese equations as shown below. Th comer pintsf the al reson are 0.0 and The value of the objective function at these points are iven in the following table : ‘Comer Points Value of Z=x+2y 00.0 o AQ2) 6 From the table, we find that maximum value of Z is 6 at A(2, 2) since the region is unbounded, we draw the geaphotx + 2y>6, graph, clearly, open half plane represented by x +2y> 6 has point common with the feasible region, a 3 +. Zhas no maximum value. © Find the number of points at which the objective function Z = 15x + 30y can be maximised subject to constraints 3x + y < 12, x + 2y<10,x20,y20. wtG 1 OOPERCENT Mathematics Class-12 We have, Z = 15x + 30y ey Subjet to constraints x + ys 12.x+ 2y$10,r20,y 20. Fosolve LPP, we convert inequations into equations and draw the corresponding lines Br¢ ye 122+ 2y=10 ‘Asx y20, the solution lies inthe first quadrant, ‘The point of intersection of x + 2y = 10 and ‘14 18 wh ycawsiaiet(/2) Weave points A(4.0),. (2 Jana (yey Now, Z= 15x + 30y 14.18). 06/4), oof 28 a$-5)-2(5 125) Z(0, 5) = 15(0) + 30(5) = 150 2(0, 0) = 15(0) + 30(0) = 0 Z(4, 0) = 15(4) + 30(0) = 60 ‘Since, Z has same maximum value on two corner ofthe fone gen, then car pros ofthe line SEE oil ior abana vole kz [-. Number of points at which Z,,.., occurs is infinite] Solve the following linear programming problem optimize (Maximise or minimise) Z= 2x+ 3y, subject toeonstrainte x+y 24,24 9722, «20,50 Sol. First we convert the inequation into equation and draw the graphs of lines whose equations are x + y= 4 and x+2y=2. From the graph, we conclude that there is no feasible rege. ie. there is no unique solution satisfying all the constraints. Hence, z has unbounded SanE Linear Programming 523 & TRY YOURSELF Determine the maximum value of Z = 11x + ‘Zy subject to the constraints: 2x + y S 6, 252,x20,y20. (Ans. 42) 2. Maximum and minimum value of objective function Z = 3x - 4y subject to x~ 2y<0,-3x + yS4,r-ys6 and x, y20. (Ans, Max-12, Min-does not exist) 3. Minimise Z = 3x + 5y subject to 2x + By > 12,-x+y<3,x54,y23. (Ans. 19.5) 4, Find the number of points at which the objective funetion Z = 4x + dy can be maximised, subject to the constraints conan Bx + dy £24, Bx + Gy < 48, x<5,y< 6,220,920. Fo TAY YOUSELE Visit http:fbitly/3FG94F6 (Ans. Infinite) = NCERT rocus 1, Maximise Z = 3x + 4y subject to the constraints 7. Minimise and Maximise Z= 5x + 10y xtyS4,x20,920. subject to x+2y< 120, x+y2 60, x-2y20,x,y20. 2. Minimise Z =~ ax+ 4y su +258, ae paw ieetyain stogen eee a Mininiieg and Mastalee 2527 77 3. Maximise Z = 5x + 3y subject to x + Sy < 15, subject to x + 2y 2 100, 2x-y50, 2x +y S200; x, y20. br + 2y 5 10,x20,y20. 4. Minimise Z = 3x + 5y subject tox+ 3y>3, x+y22,x 920 9. Maximise Z = -x + 2y, subject to the constraints: x ty25,x+2y26,y20, 5. Maximise Z = 3x + 2y subject tox + 2y< 10, 10. Maximise Z = x +y subject tox~yS—1,-x+yS0, Bxt+ys15,x%,y20 x y20. 6. Minimise Z =x + 2y subject to 2x + y2 3, x + 2y26, eles re ® For NCERT Focus solstons Siow that the minimom of Z oer ot more than bro ‘sit tpt yranaEleK Objective Type Questions 2, The feasible solution for a LPP is shown in following 2 figure. Let Z = 3x—4y be the objective function. Minimum MCQs (1 Mark} of Z occurs at 1. The corner points of the feasible region determined " by the system of linear constraints are (0, 0), (0, 40), (20, 40), (60, 20), (60, 0). ‘The objective function is, 9) a (Z= 4x + 3y. Compare the quantity in column A and column B. Column A Column B a Maximum of Z| 825 (a) ‘The quantity in column A is greater (b) The quantity in column Bis greater «a ts x (©) The two quantities are equal ' ’ ‘* (@ Therelationship cannot be determined on the basisof ) 0 ©) (8) (©) G0) ee a the information supplied. (NCERT Exemplar, CBSE 2020) (NCERT Exe524 3. Corner points of the feasible region determined by the system of linear constraints are (0, 3) (1, 1) and (3,0). Let 2x + gy, where p, q > 0. Condition on p and q, 60 that the minimum of Z occurs at (3, 0) and (1, 1) is () p=24 ©) P=l © p= @ p=q (NCERT Exemplar) 4. The graph of the inequality 2x + 3y > 6 is (a) half plane that contains the origin @ at plane that either contre the origin nor the points of the line 2x + 3y=6, (© whole XOY-plane excluding the points on the line r+ ay =6. (@) entire XOY-plane. (CBSE 2020) 5. Optimization of the objective function is a process of Maximising the objective function Maximising or minimising the objective function Minimising the objective function none of these 6. A set is said to be convex if (@_all points except the end pointe of the line segment inside the set lie inside the set (@) itis concave © all points on the line segment in the set lie inside the set @)_ none of these 7. Which of the following sets is convex? @) yi ty*21) Ob) Ky): >a © (e%9):8+4y*> 5} @) (,9):922, 954) 8. The optimal value of the objective function is attained at the points: (given by intersection of inequations with the axes © © @ 8. (a) given by intersection of inequations with x-axis only given by the corner points of the feasible region none of these Which of the following statements is correct? Every LPP admits an optimal solution () A LPP admits unique optimal solution (© If @ LPP admits two optimal solutions it has an infinite number of optimal solutions (@) The set of all feasible solutions of a LPP is not a converse set 10. If the minimum value of an objective function = ax + by occurs at two points (3, 4) and (4, 3) then, @ a+b=0 ©) © 3a=b @ a=3 (CBSE Term I 2021-22) Fill in the Blanks (1. Mark) 11. The value of objective function is maximum under i ir constraints at __ of feasible region. 12. Ina LPP, the linear inequalities or restrictions on the variables are called - (NCERT Exemplar) 13. If the feasible region for a LPP is then the optimal value of the objective function Z= ar + by may or may not exist (NCERT Exemplar) WG 1 OOPERCENT Mathematics Class-12 14. The feasible region for a LPP is always a polygon, (NCERT Exemplar) \VSA Type Questions (11 Mark} 15, Maximise Z= Sx + 49, subject to the constraints: xtys1x20,y20. (NCERT Exemplar) 16. Minimise Z = 18x ~ 16y subject to the constraints: x+yST,2x-3y+620,x20, 20. (NCERT Exemplar) Case Study - Based Questions (5x1 Mark) 17. Deepa rides her car at 25 km/hr, She has to spend 2 per km on diesel and if she rides it at a faster speed of 40 knv/hr, the diesel cost increases to € 5 per km. She has © 100 to spend on diesel. Let she travels x kms with speed 25 km/hr and y kms with speed 40 km/hr. The feasible region for the LPP is shown below : following questions. (What is the point of intersection of line J, and ly. os) G4) o(28) 0 (8 Gi) The corner points of the feasible region shown in above graph are 40 50 (a) (0, 25), (20, 0), (3 £2) (b) (©, 0), (25, 0), (0, 20) 40 50 © 0.0,(2.2), 0,2 50 40 22.42), 0, 20) Gil) If Z = x + y be the objective function and max Z= 30. The maximum value occurs at point # (23) © (5,0) @) 0,0), (25,0), ( ©) 0,0) @ ©,20,Linear Programming (iv) If Z = 6x—9y be the objective function, then maximum value of Zis (@) -20° @) 150 @ 180 © @ 2 (v) If Z= 6x + By be the objective function, then what is the minimum value of 2? (a) 120) 130 @ 0 (@) 150 Short Answer Type Questions SA Type Il Questions (3 Marks) 18. Solve the following linear programming problem graphicall Maximise 2 = -3x ~ 5y Subject tothe constraints ety sa xty23 x-2yS 2, *20,920. Long Answer Type Questions LA Type | Questions (4 Marks) 19, The feasible region for a LPP is shown in the following figure. Evaluate Z= 4x +y at each of the corner points of this region. Find the minimum value of Z, if it exists. (CBSE 2023) 525 (NCERT Exemplar) ind graphically, the maximum value of Z= 2x+ 5y, subject to constraints given below: Dx t dy s8, dx +ys6,x+yS4,220,920 LA Type Il Guestions (6 Marks) 1. Minimise Z= 8x, + 4x, subject to x, + 2x, 22, 32, +4, 23, 4x, + x, 28,x,20, 2,20 Minimise Z= ax + Sy subject to =2x+ys4,x+y23,x—2yS2,z,920 Minimise Z = 30x + 20y subject to x+ySB,x+dy2 12, Sx + 8y220,x,920 Maximise Z= 1.5 + y, subject to xty28, Sx + 5y<15,x20,y20 25. Optimize (Maximise or minimise) Z = subject to x+y>8, 2e+3y<12,x,y20 22, 23. 24, 4x + Gy, 1b): 3. (b): ‘Corner Points | Value of Z= 4x +3y ‘Comer Points | Value of vePea> 0) 4x043*0= 3) px0+gx3=39 (0,40) 40+3x40=120 a.) pel+q™l=p+q (20,40) [42043 40= 200 G0) px3+gx0=3p (60,20) | 4*60+3 x 20=300 (Maximum) ‘The minimum of Z occurs at (3, 0) and (1, 1) (0,0) 4x 6043x0=240 2 ptandp 2 24 = pad Hence, maximum value of Z = 300, which is tess than 325. So, the quantity in column B is greater. 2): Comer Points |ValueofZ=3t-4y 0) |3x0-4x0=0 (6.0) [3%5-4x0=15 (Maximum) (65) |3x6-45=-2 _| (8) [3*6-4*8=-14 (4.10) [3x4-4x10=-28 8) 3x 0-4 «8 = -32 (Minimum) Hence, the minimum of Z is -32, which occurs at (0, 8). 4. (b): From the graph of inequality 2x + 3y > 6. It is clear that it does not contain the origin nor the points of the line 2x + 3y=6. y o at 5. 0 60 72@ 8&0 %© 10. (b) : Since, minimum value of Z = ax + by occur at two points (3, 4) and (4,3). 3a+4b=4a+3b => amb.526 11. The value of the objective function is maximum under linear constraints at any vertex of feasible regions. 12. Ina LLP, the linear inequalities or restrictions on the variables are called linear constraints. 13._If the feasible region for a LPP is unbounded, then ‘optimal value of the objective function Z = ax + by may oF may not exist. 14. The feasible region for a LPP is alwaysa convex polygon. 15. Wehave, maximise Z = 3x-+ 4y, subjectto the constraints xtys1,x20,y20 Let L:x¢ y= ‘The shaded region shown in the figure as CAB is bounded, whose comer points are O(0, 0), A(I, 0) and B(0, 1) y ont Toy cr $ The value of objective function Z at these corner points are WobG | OOPERCENT Mathematics Class-12 17, (i) (b) Let B(x ¥) be the point of intersection of the given ines 2x + 5y = 100 and X44 #1 58r45y=20 40 Solving (and (i, we getx = yy =D The point of intersection B(s, ¥) = (2. ‘ i} (i) (@) : The comer points of the feasible region shown in the given graph are (0,0), A(25,0),B| (iil) (@): Here Z= 3+ y ‘Comer Points Value of Z= x+y (0) (=e (25, 0) 3 2%) pay (0,20) 20 ‘Thus, max Z = 30 occurs at point 2. 2) (i) ‘Comer Points_[Z= 3x + 4y z [Corner Foints [Value of Z=6:-9y | 00, 0) 3x0+4x0=0 0.9) o AG. 0) 3x14+49*0=3 (25,0) ‘150 (Maximum) BQ, 1) 3x0+4x1=4 Maximum) 50 40 Hence, the maximum value of 2 is 4 which is attained at the TF -~ point (0, 1) 16. Wehave, minimise Z = 13x—15y subject tothe constraints (0.20) =180 x+yS7,2x-3y+620, x20, y20. ™ ©: hae [Gomer Points [Value of Z= 6x +3y __| idx ay +6=0 any Value: =a ‘The graph of these equation is shown below. a ae = (25,0) 150 140 o * The feasible (shaded) region shown as OABC is bounded. The value of objective function Z at comer points 0(0, 0), A(7, 0), BG, 4) and C(0,2) are 18, We have, maximise z= -3x ~ 5y Converting the given inequations into equations, we get bety=4 ® ‘Comer Points _| Value of Z= 13:-15y aa 00.0) _|13*0-15*0=0 A(@.0) __|13x7-15x0=91 BG4) |13x3-15x4=-21 C2) | 13*0-15x2= -30 (Minimum) Hence, the minimum value of Z is -30, which is attained at point (0, 2).Linear Programming ‘As, x20, y2 0 so the solution lies in first quadrant. From graph, comer point of feasible region are A(0, 4), B(8/3, 1/3) and C(O, 3) The value of z at these corner points are shown as : AQ,4) BG/3.1/3)_| C@.3) Hence maximum value of 29/3 | — Maximum 3 19. From the figure, it is clear that feasible region is unbounded. Also, we have Z=4x+y xedya4 and x +y=3 Solving (i) and (ii), we get x=2andy=1 Now, solving (i) and y = 0, we get x=4and Also solving (ii) and x = 0, we get x=Oandy=3 Hence, corner points of feasible region are A(4,0), B(2, 1) and €0,3). eli) (il) ‘The value of objective function Z at these corner points are Value of Z= 4x + A [axa BQ1) 4x29 CO,3) 4% 0+3=3 (Minimum) Now, we see that 3 is the smallest value of Z at the corner point (0,3).Since, the feasible region is unbounded, therefore 3 may or may not be the minimum value of Z. Now, we draw the graph the inequality 4x + y <3 and check whether the resulting open half plane has no point in common with feasible region. Otherwise, Z has no minimum value, From the shown graph above, it is clear that there is no point in common with feasible region and hence the minimum value of Z is3 which is attained at the point (0,3) 527 20. Convert the inequation into ‘equation, we get , :2r + 4y =8, |, Sr+ye6L:xtyedx=0,y=0 | Solving I, and |, we get a(S 5 i Let us draw the graph of these a3} ‘equation. i ‘The shaded portion OABC is the * feasible region, where coordinates. "r of the comer points are O(0, 0), A(0,2), 8 ‘The value of objective function at these points are Corner Points (00,0) 2x0+5x0=0 ‘AO, 2) 2x 0+5*2= 10 (Maximum) 8 x8 458-92 a(5-5) ersten es LC, 0) 2x2+5"004 The maximum value of zis 10, which is attained at point A002). 21. Step 1: Convert inequations into equations and draw the corresponding lines x + 2x =2, 3x, +3, *3,4y, + 3x36 Asx, %;20, the solution lies in the first quadrant. me Step 2: Consider any point of the feasible region say P(1, 2). Draw iso-profit line z, passing through P(1. 2) Z=8(1) +42) =8+8=16 Thus, the iso-profit line is 8x, + 4x = ay 16 ie} 4 Step 3 : Since the objective function is of minimization type therefore draw parallel iso-profit lines towards origin to this {so profit line ; till feasible extreme points are located. From the graph we can see that the line contains only one pointe =(2,2) tte feu reion 5°5. 2,2 8x) + 4x This line passes through the point C| GG}528 Optimum solution sx=3, y=$ Minimum Z = 9.6 (unique and finite optimum solution) 22. Converting the given inequations into equations, we geth:-2e4 yA ixty=3,h:x-2y=2.x=0,y=0 Solving I, and ly, we get 45-4) Let us draw the graph of these equation as shown below. - ‘Comer points of the feasible region are 4(34) and B(0,3). The value of objective function at these comer points are given the following table. ‘Comer Points Value of Z= 384 5y (8) 97 (Minimum) 3°3 Bez) 5 From table we find that 97 is the minimum value of Z at (53) 4 Since, region is unbounded, so we draw the graph of inequality 3x4 5y <97. From graph, clearly open half plane has no point common ‘with the feasible region. if So, minimum value of 2897, which attained of a(8,2), 23, Converting the given inequation into equation, we get x4 yn8,x+dy= 12,514 8y=20 Let us draw the graph of these equations as shown below The point of intersection of the lines x + 4y= 12 and x+y =8 24) Wet 1 OOPERCENT Mathematics Class-12 Weravecorer pins a3) 8(22, £) ana co. 3 Now Z = 30x + 20y 203) = 30(0) + 20(8) = 60 3-3)-2(3 )m(5)-205 20.8) = 30) +246) = 140 Minimum value of Z is 60 which is attained at point A(0, 3), 24. Converting the given inequation into equation, we get x+y =8,3r + Sy = 15,x= 0 and y = 0. We draw the lines whose equations are x + y= 8 and ar + Sy = 15, From the graph, we conclude that there is no feasible region for this problem, Hence, the objective function has no feasible solution for the given constraints. 25. We draw the graph of the lines whose equati x4 y Band 2x +3y=12, From the graph, we conclude that every point of the shaded region satisfies both the constraints, But no point of the shaded region satisfies the non-negative restrictions. Hence, there is no feasible solution for the LPP.CONCEPT tltey oes opelenepee oe de pa nN 7 + Let Rbe the feasible region (convex polygon) for a linear programming problem and let Z= ax+ bybe the objective function. ‘When Z has an optimal valve (maximum or minimum), where the variables x and y are subject to constraints described by linear inequalities, this optimal value must occur ata corner point (vertex) of the feasible region. Remark: If is unbounded, then a maximum or a minimum value ofthe objective function may not exist. However, ifit exists, itmust occur at a corner point of R. + Let Rbe the feasible region fora linear programming problem, and let Z.= ax + bybe the objective function. IFR is bounded, then the objective function Z has both a maximum and a minimum value on R and each of these occurs at a corner point (vertex) of R LINEAR PROGRAMMI : Maximise (or minimise)Z = ¢,x, + Gx, + —+ 6x, (Objective fanction) Subject to ge, + gk +n + gC, Ooh Ey ah tS 2b Sah + Auta + Bas += teat S = +2) Sy XpXyo0%, 2 0 (no0-negativty restrictions) where all y's, bs and ¢'s are constants and x; are variables. ‘Step -3: Optimal Feasible Solution Feasible! ‘Mark common region determin by all the D> Bday pote otc wetsases ox: pinion the, objective constraints or points satisfying the constraints ofan LPR.530 wtG 1OOPERCENT Mathematics Class-12 “? MISCELLANEOUS auestions 1, Minimise Z = 12000x + 15000y Subject to constraints Sx + 4y 2 640, Sx + 2y2 400, 3x + dy2 480; x y20. Sol. To solve the LPP graphically, we convert inequations into equations to obtain the following lines. Sx + dy = 640, 5x +2y = 400, 3x +4y = 480, x= 0and y=0 ‘The line Sx + 4y = 640 meets the coordinate axes at .A(128, 0) and BO, 160). ‘The line 5x + 2y = 400 meets the coordinate axes at ‘C{80, 0) ard D(0, 200), The line 3x + 4y = 480 meets the coordinate axes at (160, 0) and F(0, 120). The point of intersection of lines 5x + 4y = 640 and. 5x + 2y = 400 is QG2, 120) The point of intersection of lines 5x + 4y = 640 and 3x + 4y = 480 is P(80, 60). ‘The shaded region DQPE represents the feasible region of the given LPP. ‘The comer points of the feasible region are D(O, 200), Q(32, 120), P(80, 60) and F(160, 0) The values of the objective function at these points are Corner Points | Value of Z = 12000x + 15000y ‘D{0, 200) 30,00,000 is (32, 120) 21,84,000 (80, 60) 18,60,000 (Minimum) (160, 0) [19.20.00 From the table, we can observe that 1860000 is the minimum value of Z at P(80, 60). Since the region is unbounded we have to check that the inequality 12000x + 15000y < 1860000 in open half plane has any point in common or not. Since it has no point in common. So, minimum value of Z is at (80, 60) and the minimum value of Z is 18,60,000. ically the minimum value of the 2 Determine gr objective function 50x + 20y ee Subject to the constraints: 2r-y2-5 on (2) ar+ye3 a) 2e— ays 12 = @) 20,920 6 (CERT) Sol. First of all, let us graph the feasible region of the system of inequalities (2) to (6). The feasible region (shaded) is, shown in the figure. We can observe that the feasible region is unbounded. We now evaluate Z at the corner points. Corner Points | Value of Z=~ 50x +20y 0.5) 100 3) 0 (0) -50 6,0) 300 (Minimum) From this table, we find that 300 is the smallest value of Z. at the comer point (6, 0). Can we say that minimum value of Z is -3002 Note that ifthe region would have been bounded, this smallest value of Z is the minimum value of Z. But here, we see that the feasible region is unbounded. ‘Therefore, ~ 300 may or may not be the minimum value of Z. Todecide thisissue, we graph the inequality ~50x + 20y <~300 ie, ~ 5x + 2y < 30 and check whether the resulting open half plane has points in common with feasible region oF not. Ifit has common points, then ~300 will not be the minimum, value of Z. Otherwise, ~ 300 will be the minimum value of 2. As observe from figure, it has common points. Therefore, Z= -50x + 20y has no minimum value subject to the given constraints 3. Minimise Z = 6x + 3y subject to the constraints 12+ 3y 2240, 4x + 20y2 460 and 6x + 4y $300Linear Programming Sol, We have, 12x + 3y 2240 ie, 4x + y 280 4x + 20y2 460 ic,,x + 5y 2115 6x + 4y $300 ie, 3x + 2y $150 x20,y20 Let us graph the inequalities (1) to (4), ‘The feasible region (shaded) determined by the constraints (15,0) 80 100 120 re Sy 15 arey=80 V3r+2y=150 ‘The coordinates of the corner points L, M and N are (2, 72), (15, 20) and (40, 15) respectively. Let us evaluate Z at these points: Corner Points Value of Z= 6x +3y 272) 28 5, 20) 150 (Minimum) (40, 15) 285 From the table, we can observe that Z is minimum at the point (15, 20). 4, Solve the following LPP graphically : Maximum 2 = 5x + 7y subject to x+yS4,Sx+8yS24, 10x+ 7y$ 35, x,920 Sol. First we draw the line x+y =4,3x + By = 24 and 10x +7y =35 531 ‘The feasible region (shown shaded) is the bounded region OEPQD. Vertices of feasible region are 7s 8 12 00,0, £35, 0, (5: 8} 0(8,2 Jana p0.2 Given:2=5247y ‘The value of objective function z at these comer points are : at EQ5,0),2=175 at 00,0), z=0 at D(0,3),2=21 Thus, z has maximum value 248, which is attained at point {8 22) tani = 5. Find the maximum and minimum values of 5x + 2y, subject to the constraints = 2x By S-6, he,, 2x + By 2 6;x-2yS2; 6x4 4y<24;— Br 4 2yS3;x20andy20 Sol. Let Z= 5x +2y First, we draw the line - 2x - 3y =~ 6, ie, 2+3y=6, x-2y= 2, 6x +4y = 24 and -3x+2y=3 The feasible region (shown shaded) is the bounded region ABCD. From the figure, we have the corner points of the feasible 18 2 73 315 34 ssvonas (7.5) 965-3} ¢(5-4 (rts) These points have been send by solving the equations of the corresponding intersection lines simultaneously. ‘The value of objective function Z at these corner points are Given: Z =5x+2y a a(B.2)}2-% 0 o(Z.2}2-19 77 7 2 3,2) 3 %),_8 a (pF) z sa lea} B leary, the maximum value ours at vertex B and the minimum value at vertex D, and these are 19 and & respectively,532 WebG 1OOPERCENT Mathematics Class-12 1S COMPETITION Focus Multiple Choice Questions 1. The shaded region in the figure is the solution set of the inequations 6.0) (a) 5rt 4y520,x6,ys3,x20,y20 @) 5x4 dy220, x56, 23,220,920 (© Sx +4y220,x56,953,x20,y20 @ 5x4 4y220,x26,yS3,x20,920 ) 2. Ifan LPP admits optimal solution at two consecutive vertices of a feasible region, then (@)_ the required optimal solution is at the midpoint of the line joining two points. () the optimal solution occurs at every point on the line joining these two points. (©). the LPP under consideration is not solvable. (@) the LPP under consideration must be reconstructed. 4) 3. The objective function 2 = 4x, + 5x,, subject to 2x, + 2,27, 2x, + 3x, $15, x, $3, x,,x,2.0 has minimum value at the point (a) On x-axis (b) On y-axis (© Atthe origin (@ On the line parallel to x-axis Shp) 4. The objective function 2 = x, + x», subject to , +x, S$ 10,~2x, + 3x, 15,x, $6,x,,x,20has maximum value of the feasible region. (a) at only one point (>) at two points (©) at every point of the segment joining two points (@)_at every point of the line joining two points 507) 5. The shaded region shown in fig. is given by the inequation (0,14) 9,14) aa x (a) 14+ 5y270,yS 14 andx-y25 (b) 14x + 5y>70,y>14 and x—5 (© l4r45y>70,y<14andx—ys5 @) 14x+5y $70, y<14 and x-y25 25 ie) *6. Laksmi wants to buy few bangles and ear drops. Each bangle costs % 5 and each ear drop costs Z 10. She should buy atleast 6 bangles and atmost 2 ear drops. If she buys x bangles and y ear drops with minimum expenditure then the formulation for this linear programming is (@) Maximise 5x + 10y subject to x26, yS2,x,y20 (b) Minimise 5x + 10y subject tox26,yS2,%,y20 (©) Maximise x+y subject to 5x + 10y< 50, x, y>0 (4) Maximise 6r + 2y subject to 5x + 10y < 50, x, y>0 ) 7. A mathematical model written to construct a ‘maximum area rectangle out of a thread of length 10 em is given by ‘Maximise ld such that 2(! + 6) = 10, 1, b> 0 where 1 & b are the length & breadth of the rectangle. This is not a linear programming problem because (a) 1& bis always positive () first constraint is an equation (©) the objective function is not maximise (@) objective function is not linear i) 8 Mxtys2,x20, y20 the point at which maximum value of 3x + 2y attained will be @ ©,2) ©) @,0) @ (4) 2°2 8. Consider the linear programming problem Max. Z=4x+y Subject tox+y<50;2+y2100;x, y20 © @,0) ) (©) marked questions are not part ofthe latest CBSE sylabus but are useful for athe competine exams.Linear Programming ‘Then, the max value of Z is (@ 0 ) 50 (© 100 (@) doesnot exist —_SAp) 10. Consider Minimise 2 = 3x+2y subject tox +y 28; Sx + 5y S15; x,y20 Ithas (a) infinite feasible solutions (@)_unique feasible solutions (©) no feasible solution (@)_none of these Integer/Numerical Value iven the LPP Minimise f= 2x, — x, ¥,20,x,20; xy tx, 25; “xy +x, $1; 5x, +43, 540 533 ‘Then, find the minimum value of the given LPP. 12, Let z= x+y, then the maximum of z constraints y2 |x] ~1,y<1-|x1,x20,920 sig fy 13, Find the maximum value of z = 10x + 6y subject to constraints x20,y20,x+y<12,2¢+yS20. Sap) 14. The maximum value of Z = 4x + y subject to the constraints, x +y $50, ax +y<90,x20,y20i8 *15. A doctor wishes to mix together two kinds of medicines Xand Yin such a way that the mixture contains at least 10 units of iron, 12 units of calcium and 8 units of potassium. The content of 1 kg food is given below : Food Iron | Calcium | Potassium x 1 2 3 (cy ‘he Cost of one medicine X is % 16 and cost of medicine Y is 20. Find the least cost of the mixture which will produce in a particular disease. 1. (0): Clearly, shaded region represents Sr+4y>20,x<6,yS3,x20,y>0 2. (b): The optimal solution occurs at every point on the line joining these two points. 3. (a): Converting the given inequations into equations, we get 2x, +1, =7,2r, + 3x, = 15,x, 93,2, =x,50 Ho tates? 2 8 3ep= 1S ‘The feasible region is ABCD which is shaded in the figure. 18 ‘The vertices of the feasible region are (50). a C@,3) and D@.9), ‘The values of 2 = 4x, + 5x, at these vertices are pigs - a(E0) | | (20) = | cea Zz De3) 3B From table, we can observe that minimum value of = is 14, which is attained at a(S} Hence, minimum value occurs on 2-2. 4. (@):Wehave : Objective function maxon subject tox, 10;- 2x, #3515, %)56,3~ 20 Convert the given inequality into equality and draw the graph oft534 :. The corner points of the feasible region are (0,0), (0, 5), 7). (6.4) and (6, 0). Value of the objective function 2 =x,¢ x 0.19] 18,14) ol 6,0) Line (L,) represent an equation 14r-+5y=70 Since, shaded region (L,) does not contain origin, + Its corresponding inequation is lax + 5y>70 Line (L,) represent an equation x~y=5 Since, shaded region (L,) contain the origin. ++ Its corresponding inequation is x - y<5 (i) Line (L,) represent an equation y = 14. Its shaded region contains the origin. J+ Its corresponding inequation is y<14 From (i), (i) and (ii), we get Vr +5y>70,x-y O occurs at both (2, 4) and (4, 0), then (@) a=2b (b) 2a=b () a=b (@ 3a= 4. Corner points of feasible region of inequalities gives (@) optimal solution of LPP (b) objective function (© constraints (@)_ linear assumption 5. Minimise 2= Sey Aa subject to x =4,, 751, 2,45 mand zw Bj FHL2 a is an LPP with number of constraints ) m-n @ mm @ (a) m+n = 6. Which of the following term is not used in a linear programming proble: (a) decision variable (b) objective function (© concave region (@) feasible region 7. Objective function of a LPP is (@) aconstraint (b) a function to be optimized (©) arelation between the variables (@)_none of these 8 Let X, and X, are optimal solutions of a LPP, then AX, + 1-2) X,, 4€ Ris also an optimal solution X=2X, + (1-2) X,, 0525 1 gives an optimal solution 2X, + (1 +2) X, 052-5 1 gives an optimal solution (@ X=AX, + (1 +2) X,,.€R gives an optimal solution 9. Consider a LPP given by Minimum Z = 6x + 10y Subjected to x> 6; 22; 2x+y210;x, 920 Redundant constraints in this LPP are (@) x20,y>0 (b) x26,2x+y>10 © 2+y>10 (@ none of these 10. If the constraints in a linear programming problem ‘are changed (a) the problem is to be re-evaluated (b) solution is not defined (©) the objective function has to be modified (d)_ the change in constraints is ignored 11. Which of the following is not a convex set? @) (Gy) :2x+5y< 7} ) (Gy): +y¥*< 4} © ber lxl= @ (W282 + 2y7 <6} 12. The region represented by the inequation system Ry2OysGxtys3is @) bounded in first quadrant (b) unbounded in first and second quadrants (©) bounded in first quadrant (@)_ none of these Fill in the Blanks 18. Ina LPP, the objective function is always, 14. Ina LPP, ifthe objective function Z'=ax + by hs the ‘same maximum value on two corner points of the feasible region, then every point on the line segment joining these two points give the same value.538 15. A feasible region of a system of linear inequalities is said to be. if it can be enclosed within a cirele. 16. A corner point of a feasible region is a point in th region which is the of two bout ry Hines = Case Study Based Questions Case | (4 x 1 Mark) 17. Comer points of the feasible region for an LPP are ©, 3), (5, 0), (6, 8), (0, 8). Let 4x — Gy be the objective function. Based on the above information, attempt any 4 questions. (i) The minimum value of Z occurs at @ 68) © 69 © 3) @ 0% Gi) Maximum value of Z occurs at (@) 6.0) ©) 8) © 03) @ 68) (iii) Maximum of Z - Minimum of Z= () 58) 68) 7B @) 8B {iv) The corner points of the feasible region determined by the system of linear inequalities are (@) 0,0), 3, 0), (, 2), 2,3) ©) (3,0), (3,2, 2, 3, © ©,0), (3, 0.8.2. 2 3), 0,3) (@) None of these (¥). The feasible solution of LPP belongs to (a) first and second quadrant (b) first and third quadrant (©) only second quadrant (d) only first quadrant Case Il (2 x 2 Marks) 18. Linear programming is a method for finding the optimal values (maximum or minimum) of quantities subject to the constraints when relationship is expressed as linear equations or inequations. Based on the above information, answer the following questions (H) _ Find the common region of the inequality 5x + 6y > 30 and 3x + 4y< 12, (ii) The feasible region for an LPP is shown in the figure. Oo WG 1 OOPERCENT Mathematics Class-12 Lot Z= Tx + 29y be the objective function. Then, at which point the value of Z be maximum? SESS SECTION: Bhs RES 19. Maximise the function Z = 11x + Zy, subject to the constraints: x $3, y $2,x20andy20. OR ‘The feasible region for « LPP is shown in following figure. Find the minimum value of Z= 11x + 7y. Y, 20, Maximise the function z= 10x + 25y subject to constraints 0 0.5; 100x + 150y > 600 and x y = 0, where x, y are the units of food A & B respectively required to minimise the cost. 25, Maximise Z= 1500x+ 2000) a 2sx58 % Isys6 Gi) x+ys10 iii) x, y20 iv) ® For EXAM DRIULs Soisions i Visit tpi iy tyteL U Oo