a | as LINEAR PROGRAMMING MULL pasiC CONCEPTS AND IMPORTANT RESULTS (7 Linear programming, Linear programming is a method for determining optimum values of a linear function subject to constraints expressed as linear equations or inequalities. Three classical linear programming problems (L.P.P) are (i) Manufacturing problems (if) Diet problems (iti) Transportation problems Some definitions Objective function. If My, Ayy «+», , are constants ANA Xyy Kap ++ Xy, NE variables (sometimes called decision variables), then the linear function Z = a,x, + AX, + »-- + ,x, which is to be optimized, (maximized or minimized) is called the objective function. It is always non-negative. Non-negative restrictions. The values of the variables X,, Xp --- , X, inan LPP. are always non negative (2 0). Constraints. The inequalities or equations on the variables of an L.P.P, are called constraints. may be of =, >, % < or < type Feasible region and feasible solution The common region determined by all the constraints of an LPP. is called a feasible region a every point in this region is called a feasible solution to L.P.P. The feasible region is al convex set. Feasible region may be bounded or unbounded. Optimal solution. A feasible solution which maximizes or minimizes the objective function is a an optimal solution, An L.PP. may have zero, one or more than one optimal solution. 1) Formulation of an L.RP. in two variables x and y There are three steps in the mathematical formulation of an LPP. and solving it. These a (i) To identify the objective function as a linear combination of variables (x and y) and to o all constraints i, linear equations and inequalities involving these variables. Thi can be stated mathematically as : Maximize (or minimize) Z = ax + by subject to the conditions ax + by S (or 2 or = r > or <) c, where i= 1 fom sh and the non-negative restrictions x > 0, y 2 0.(ii) To find the solutions (feasible region) of these equations and inequalitie °s by some method. Here we will study only the graphical method. mathe naticy (iii) To find the optimal solution i.e. to select particular values of the variables x si SX and the desired value (maximum/minimum) of the objective function. 4 that Sine Graphical method of solving an L.PP. The following theorems are fundamental in solving L.P.P. Theorem 1. Let R be the feasible region for an L.P.P. and Z = ax + by be the Objective When Z has an optimal value (maximum or minimum), subject to the constraints tested : ed feasible PeRion, objective furtction Tum value on R and linear inequalities, this optimal value must occur at a corner point (vertex) of the Theorem 2. Let R be the feasible region for an L.PP. and Z = ax + by be the R is bounded, then the objective function Z has both a maximum and a minim each of these occurs at a corner point (vertex) of R. Remark. If R is unbounded, then objective function may or may not have value. However, if it (maximum/minimum) exists, then by Theore point of R. @ maximum oF minim m ™ 1, it must occur at eomng Corner point method To solve an L.PP. graphically, we follow these steps 1. Convert the given linear constraints into equalities and then draw their graphs thigh Will be straight lines. 2. Find the fe ible region of the L.PP. and label the corner points, Evaluate the objective function Z = respectively the largest and smallest v x + by at each corner point, and let M and ues, 4. If feasible region R is bounded, then M and m are the maximum and minimum valued If feasible region R is unbounded, then (@) Mis the maximum value of Z if the open half plane ax + by > M has no point ing with the feasible region. Otherwise Z has no maximum value. (8) mis the minimum value of Z. if the open half plane ax + by 0, then the condition oni Pand q so that the minimum of Z occurs. at (3, 0) and (1, 1) is (@) p=2q pro=t (©) p=39 @ p=q coh g The corner points of the feasible region for an L.PP. are (0, 10), (5, 5), (15, 15) and (0, 20). If the cbjective function is Z'= px + gy, p,q> 0, then the condition on p andiq $o that the maximum of Z occurs at (15, 15) and (0, 20) is (a) every pointon the @) p=q () p=2q (©) q=2p (d) q=3p 9 In an L-PP. ifthe objective function Z = ax + by has same maximum value on two comer Points of the feasible region, then the number of points at which maximum value of Z occurs is 0 2 (©) finite (@) infinite 10. The graph of the inequality 2x +3y>6is 7, 0 | Q (0) half plane that contains the origin a) 40) half plane that neither contains origin nor the points of the line 2x + 3y = 6 (0) whole XOY-plane excluding the points on the line 2x + 3y = 6 (@) entire XOY-plane. Solutions to Multiple Choice Questions 1. Z=5x4+ Jy At (0,0), Z=5x0+7x0=0 At(7,0), Z=5x7+7x0=35 At (3,4), Z=5x3+7x4=43—> MaximumAt(0, 2) 5x04 4 Wi the maximum of Z occurs at (3, 4): Option (0) is the correct answer 2 ay = ay At (0,0), Z=3x0 0 AU(S, 0), 4x 8-4 0@ 15> Maximum At(6,5), Zedx6-4x5=-2 At (6, 8), 3x6-4x8=-14 At (4,10), 2=3x4—4« 10=-28 At(0,8), Z=3x0-4x 8-32 Minimum Hence, the minimum of Z occurs at (0, 8). Option (b) is the correct answer Maximum of Z occurs at (5, 0) (see solution 2) Option (a) is the correct answer At (9,0), Z=3x9+4x0=27 At (4, 3), At (2,5), At(0,8), Z=3x0+4x8=32, > Minimum. Hence, minimum of Z occurs at (4, 3). Option (c) is the correct answer 5. F=4x+6y At (0,2), F=4x0+6x2 At (3,0), F=4x3+6x0=12— Minimum At (6,0), F=4x6+6x0=24 At (6,8), F=4x 646% 8=72—> Maximum At (0,5), F=4x0+6x5=30. Since minimum of F occurs at (0, 2) and (3, 0). It means minimum value of point on the line segment joining the points (0, 2) and (3, 0). Option (A) is the correct answer. 6. Maximum of F—minimum of F = 72.~ 12 = 60 (see solution 5) Option (a) is the correct answer. 7. Z=px+qy,p,q>0 - Minimum of Z occurs at (3, 0) and (1, 1) => px34qx0=pxl+qx1 2 Minimum => 3p=pt+q>2p=q=>p= , + Option (b) is the correct answer. 8. Z=px+qy,p.q>0 Maximum of Z occurs at (15, 15) and (0, 20)yx ib +4qx15=px04+qx 20 15p + 154 = 209 => 1p = q=3? option (a) is the correct answer maximum of Z occurs at two corer points of the feasible region, then maximum of Z jecurs at every point on line joining those two points. Option (a) is the correct answer. 2x0+3x0F6 ax +3y>6 9. 10. represents half plane that does not contain the origin. Also,2x +3y #6, so, half plane does not contain the points on the line 2x + 3y = 6. Option (b) is the correct answer. ; Multiple Choice Questions (Unsolved) Choose the correct answer from the given four options in each of the following questions (ito 7) : ; 1. The objective function of an L.PP. is (a) aconstant (6) a linear function to be optimized (€) aninequality (a quadratic expression 2. The feasible region for an L.PP. is shown alongside: Let Z = 5x + 7y be the objective function. Maximum of Z occurs at (a) 0,0) () 60) (©) @,4) (d) (0,2) ,2)¢ o 00) 69 3. The corner points of the feasible region determined by the system of linear inequalities (0,0), (4,0), (2,4) and (0,5). If the maximum value of Z = ax + by where a, b > O occurs a (2,4) and (4,0), then (@) a=2b (& 2a=b ( a=b (a) 3a=b 4. The corner points of the feasible region determined by the system of linear inequel (0,3), (2,2) and @, 0). Ifthe minimum value of Z = ax + by, a, b> 0 occurs at both ( (2,2), then @ aaa @ 20=b © a=b OgeeC ANY pp. is shown in figure (adjoining). Y, 5. The feasible region for an LPP. is I Let Z = 3x ~ dy be the objective function. Minimum of Z occurs at (0, 8) (6, 8) (@) 0,0) nA) (0,8) (© 6,0) (a) (4,10) (6,5) oO f alt (0, 0) 6. Refer to Q.5. (Maximum of Z + minimum of Z) is equ if (a) 13 ® 13 @1 @ a7 7 f cd by the system of li 7, The corner points of the feasible region determines inet gy (0, 0), (0, 40), (20, 40), (60, 20), (60, 0). The objective function isZs Conan tt quantity in column A and column B: ‘cS Column A Column B & Maximum of Z 325 (@) The quantity in column A is greater, (b) The quantity in column B is greater. Yy $280 (0) The two quantities are equal. (@) The relationship cannot be determined on the basis of information given, Aop oe Answers 1. @) 2@ 3. (a) 4. (b) 5. (b) 6. (d) 7. (b) Case-Study Based Example (Solved) Case-Study 1 The feasible region for an L.PP is shown in the figure given below: Based on the given information, answer () The equation of the line AD is (@) 2x+y=40 the following questions: () x+2y=50 (©) x+2y=40 MCQs in Mathematics-XiI (Term 1) Se:{ay The equation of the tine BC is 2 = 40 b) @ axty=4 W)x42y—40 — () x42y=50 (a). none of these (i. The coordinates of the points B and C respectively are {@) (10,20), 20) () (20, 20), 20,0) (e) (20, 10), (0,20) (ay (10) 20), (20,0) (io) Constraints for the LPP, are (a) 2x + $50, x4 2y $40, x>0,y>0 20,y20 (9 2x + $50, x + 2y>40,x>0,y>0 (@ 2x+y250, x4 2y $40, x>0, y>0 (b) 2x4 y 250, x + 2y>40, x (0) The maximum value of the objective function Z = 3x-4 4y is (@) 80 (®) 100 75 solution. (i) From the given figure, OA = 25 and OD = 50. ‘The equation of the line AD is, = +t (d) 140 ie (intercept form) ie. x+y =50. Option (@) is the correct answer. (i) The equation of the line BC is 4% 27 40 20 ie. x+2y=40. Option (b) is the correct answer. (ii) Solving equations 2x + y = 50 and x + 2y -. The coordinates of point B are (20, 10). From the given figure, the coordinates of point C are (0, 20). . Option (0) is the correct answer. (i) As (O,0) lies in the region 2x + y <50 and (0, 0) also lies in the region x + 2y <40, therefore, the constraints for the LPP. are 2x + y<50,x + 2y<40,x20,y20 ©. Option (2) is the correct answer. ‘a (0) The corner points of the feasible region are O(0, 0), A(25, 0), B@20, 10) and C(0, 20). Objective function is Z = 3x + 4y. The values of Z at the corner points are : atO(0,0), Z=3x0+4x0=0, at (25,0), Z=3%25+4%x0=75, at B(20, 10), Z=3 x 20 +4 x 10 = 100, at C0, 20), Z=3x 044 x 20=80. 40 simultaneously, we get x = 20, y = 10.jective function Z Jue of the ob 3x + dy is 100 and it ig atta The maximum value « . point B . b prrect answer: Option (b) is the correct an Case-Study Based Question (Unsolved) Case-Study 1 a The feasibl gion for an L.PP. is shown in the adjoining figure. The line CB is parallel to OA. Based on the given information, answer the followin questions’ ) The equation of the line OA is (@)x-2y=0 —(b) y-2=0 ()x+2y=0 (a) 2x+y=0 (ii) The equation of the line BC is 40 () x-2y (y+W=4 (d) x+2y= The coordinates of the point B are (a) (6, 14) (b) (6,20) (© ©, 16) (d) (16,6) 0) The constraints for the LPP. are (@) y>2x,y-2x<4,x<6,x20,y20 (©) yS2x,y-2x<4,x<6,x>0,y20 (0) y22x,y-2x>4,x<6,x>0,y>0 (@) yS2x,y-2x>4,x<6,x>0,y>0 (©) The minimum value of the objective function Z = 3x — 4y is @o () -16 (©) -30 6.0) 246 8m x Answer @® (i) @ (ii) (©) (2) @ &@ Assertion-Reason Type Questions (Solved) These type of questions consist of two Statements Statement | is called Assertion (A) and Statement 11 is called Reason (R), carefully and an he questions by choosing one of the options given below: (2) Both the Statements are true and Statement IL is the correct explanation (b) Both the Statements are true ‘nd Statement IL is not the correct expl (c) Statement Lis true, Statement I1 is false. (4) Statement 1 is false, Statement 11 is true. 1. The corner points of the feasible reg on for an L.PP. are (60, 0), (120, 0), objective function Z = ax + by, i 4, b > 0 has maximum value 600 at 198 MCQs in Mathematics-XII (Term 1)rement Iz Mininnum value of Z, = 300 a syatement 2 5,b= 10, “ye corner points of the feasible region for an LPP. are (4 2 z ch The objective function Z = ax~by +1900, a, b (4, 0), (5, 0), (5, 3), (3, 5), (0, 5) and ralue 1550 at (0, 5). > Ohas maximum value 1950 at (5, 0) and ini patement I: The value of Z at point (5, 3) = 1740 statement II: a= 10, b = 70. 4, statement I Ifthe feasible region for an LPP, is bounded, then the obj Pade Hus both maxinewm and minimum values, te objective function Z = ax + by statement II: A feasibl le region of a system of linear ine sane lit enclosed within a circle qualities is said to be bounded if it can be solutions to Assertion-Reason Type Questions 1, Z=ax + by has maximum value at points (120, 0) and (60,30), | So, 120 +0 = 600 => a=5, Also, 60a + 30b = 600 => 60 x 5 + 30b = 600 | => 30b=3005b=10 b=10 -. Statement Il is true, Now, Z = 5x + 10y Value of Z at (60, 0) = 5 x 60 +0 = 300 > Minimum. | Value of Z at (120, 0) =5 x 120 + 0 = 600 | Value of Z at (60, 30) = 5 x 60 + 10 x 30 = 600 | Value of Z at (40, 20) = 5 x 40 +10 x 21 Statement I is true. Hence, both Statements I and II are true and Statement Il is the correct explanation of Statement I. 00. :. Option (a) is the correct answer. Z=ax — by + 1900 has maximum value 1950 at (5, 0). So, 5a +1900 = 1950 => 5a = 50 => a= 10 and Z has minimum value 1550 at (0, 5). So,0=5b + 1900 = 1550 = -5b = -350 => b=70 10,b=70 Also, value of Z at (5, 3) = 10 x 5-70 x 3 + 1900 = 1740. Hence, both Statements I and II are true and Statement II is the correct Statement I. . Option (a) is the correct answer. Statement I is true by theorem. Statement II is also true but Statement Il is not the correct explan +. Option (b) is the correct answer. = y | Somers