CHAPTER 12 ~~ Linear Programming CASE STUDY / PASSAGE BASED QUESTIONS yo Linear programming isa 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. syllabus (i The optimal value of the objective function is attained at the points Introduction, related @ ates terminology such (b) on Y-axis asconstraints, (©) which are corner points of the feasible region ee ee (@) none of these optimization, differenttypesof (li) The graph of the inequality 3x + 4y < 12is linear programming (a) half plane that contains the origin (LP) problems. . - Cawedos (b) half plane that neither contains the origin nor the points of the line 3x + 4y =12. of Soa (©) whole XOY-plane excluding the points on line 3x + 4y = 12 problems in two (d) None of these ee (ili) The feasible region for an LPP is shown in eric (cera the figure. Let Z = 2x + Sy be the objective feasible and function. Maximum of Z occurs at infeasible solutions, @ 7.0 optimal feasible solutions (up to (b) (6,3) three non-trivial . constraints). © 06 @ 45) (iv) The corner points of the feasible region determined by the system of linear constraints are (0, 10), (5, 5), (15, 15), (0, 20). Let Z = px + qy, where p,q > 0. Condition on p and q so that the maximum of Z occurs at both the points (15, 15) and (0, 20) is (a) p=q (b) p=2q (© q=2 (@ q=3p(v) 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 Z = 4x + 3y. ‘Compare the quantity in Column A and Column B ‘Column A Column B Maximum of Z 325 (a) The quantity in column A is greater () The quantity in column Bis greater (c) The two quantities are equal (@) ‘The relationship cannot be determined on the basis of the information supplied. Deepa rides her car at 25 km/hr. She has to spend % 2 per km on diesel and if she rides it ata faster speed of 40 km/hr, the diesel cost increases to 2 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 : Based on the above information, answer the following questions. (i) What is the point of intersection of line I, and J. 40 50 50 40 -50 40 50 —40 9 (3-3) » (35) 9 (4) o ( 3°73 } (ii) The corner points of the feasible region shown in above graph are 40 50 (a) (0,25), (20, 0), (2: : ) 50 40 © 0, (22). (0,20) (@ (,0),(25,0), (2-4).0 20) (iii) If Z =x + y be the objective function and max Z = 30. The maximum value occurs at point ~ 9y be the objective function, then maximum value of Zis (a) ( (b) 150 (c) 180 (d) 20 (¥) IfZ = 6x + 3y be the objective function, then what is the minimum value of Z? (a) 120 (b) 130 (0 (d) 150 (b) (0,0), (25, 0), (0, 20) (b) (0,0) (©) (25,0) (a) (0,20)Corner points of the feasible region for an LPP are (0, 3), (5, 0), (6, 8), (0, 8). Let Z = 4x ~ 6y be the objective function. Based on the above information, answer the following questions. (i) The minimum value of Z occurs at (a) (6,8) (b) (5,0) (©) @,3) (@) 0,8) (ii) Maximum value of Z occurs at (a) (5:0) (b) (0,8) © 3) (@) (6,8) (iii) Maximum of Z - Minimum of Z = (@) 58 (b) 68 © 78 (@) 88 (iv) The corner points of the feasible region determined by the system of : linear inequalities are (a) (0,0), (-3,0), (3, 2), (2,3) (b) (3,0), (3, 2), (2, 3), (0, -3) (©) (0,0), (3,0), (3,2), (2,3), (0,3) (d) None of these (v) The feasible solution of LPP belongs to (a) first and second quadrant (b) first and third quadrant (©) only second quadrant (4) only first quadrant YY — Suppose a dealer in rural area wishes to purpose a number of sewing machines. He has only & 5760 to invest and has space for at most 20 items for storage. An electronic sewing machine costs him Z 360 and a manually operated sewing machine Z 240. He can sell an electronic sewing machine at a profit of 22 and a manually operated sewing machine at a profit of & 18. Based on the above information, answer the following questions. (1) Let x and y denotes the number of electronic sewing machines and manually operated sewing machines purchased by the dealer. fit is assume that the dealer purchased atleast one of the the given machines, then (a) x+y20 (b) x+y<0 (© xt+y>0 (@ x+yso (ii) Let the constraints in the given problem is represented by the following inequalities. x+yS20 360x + 240y < 5760 xy20 ‘Then which of the following point lie in its feasible region. (a) (0,24) (b) (8,12) (©) (20,2) (a) None of these (iti) Ifthe objective function of the given problem is maximise z = 22x + 18y, then its optimal value occur at (a) (0,0) (b) (16,0) © &12) (@) (0,20)(iv) Suppose the following shaded region APDO, Y represent the feasible region corresponding to. mathematical formulation of given é, problem. rN ‘Then which of the following represent the e coordinates of one of its corner points. - (a) (0,24) o (b) (12,8) & (©) (8,12) (@) (6,14) [fan LPP admits optimal solution at two consecutive vertices of a feasible region, then (a) the required optimal solution is at the midpoint of the line joining two points. (b) the optimal solution occurs at every point on the line joining these two points. (©) the LPP under consideration is not solvable. (d) the LPP under consideration must be reconstructed. wy) ya Let R be the feasible region (convex polygon) for a linear programming problem and let Z = ax + by be the ‘objective function. When Z has an optimal value (maximum or minimum), where the variables x and y are subject to constraints described by linear inequalities, this optimal value must occur at a corner point (vertex) of the feasible region. Based on the above information, answer the following questions. (i) Objective function of a LPP. is (a) aconstant (b) a function to be optimised (©) arelation between the variables (d) none of these (ii) Which of the following statement is correct? (@)_ Every LPP has at least one optimal solution. (b) Every LPP has a unique optimal solution. (©) Ifan LPP has two optimal solutions, then it has infinitely many solutions. (d) None of these (iii) In solving the LPP : “minimize f = 6x + 10y subject to constraints x> 6, y>2,2x-+ y2 10,x20, y2 0" redundant constraints are (a) x2 6,y 22 (b) 2x+y 210,x20,y 20 (©) x26 (d) none of these % G10) (iv) The feasible region for a LPP is shown shaded in the figure. ‘oat 15p=5q = q=3p Corner Points Value of Z = 6x - 9y (8) (b): Construct the following table of values of the (0,0) ® ‘objective function : (25,0) 150 — Maximum Corner Point Value of Z = 4x+3y 50 *) 20 (0,0) |4x0+3x0=0 aan an (0,40) |4x0+3%40=120 420) 7 (20,40) | 4x20+3x40=200 ) ©: (60,20) | 4x 60+3x20=300 <— Maximum ‘Corner Points Value of Z = 6x + 3y (60,0) __|4x60+3x0=240 0.0) aay 2. (i) (b):Let B(x, y) be the point of intersection of (25,0) 150 the given lines 2x + Sy = 100 140 d © 42 -1 s8x+5y=20 and + K =1arssy 03. Construct the following table of values of objective function Corner Points Value of Z = 4x - 6y (0,3) 4x0-6x3=-18 (5,0) 4x5-6x0 (68) 4x6-6%8=—-24 (0,8) 4x0 6x8=~48 @_ (d): Minimum value of Z is ~48 which occurs at (0,8). : Maximum value of Z is 20, which occurs at : Maximum of Z - Minimum of Z = 20- (-48) = 20 + 48 = 68 (iv) (€): The corner points of the feasible region are (0, 0), A(3, 0), BG, 2), C12, 3), D(O, 3). ™ @ 4 WO (ii) (b):Since (8, 12) satisfy all the inequalities therefore (8, 12) is the point in its feasible region. 360 It can be observed that max z occur at (8, 12). Thus, z will attain its optimal value at (8, 12). (iv) (9): Wehave, x+y=20 and 3x + 2y = 48 On solving (i) and (i), we get x=8,y=12. ‘Thus, the coordinates of Pare (8, 12) and hence (8, 12) is one of its corner points. ii) (¥) (b): The optimal solution occurs at every point on the line joining these two points. 5. (i) (b): Objective function is a linear function (involve variable) whose maximum or minimum. value is to be found. (i) (©): If optimal solution is obtained at two distinct points A and B (corners of the feasible region), then optimal solution is obtained at every point of segment [4]. (iii) (b): When x2 6 and y22, then 2e+y22x6+2ie,2x+y214 Hence, x> 0, y> 0 and 2x + y> 10 are automatically satisfied by every point of the region {x y):x26}.0 (x y):y22} (iv) (b): Construct the following table of values of the objective function = Corner Point Value of Z=3x-4y 0) [3x0-4x0 6,0) 3x5-4x0=15 (6,5) 3x6-4x5=-2 (6,8) 3x6-4x8=-14 (4,10) 3x4-4x 10=-28 8) [3x0-4x8=-32 Minimum Minimum of Z = - 32 at (0, 8) (¥) (a): Construct the following table of values of the objective function F : Corner Point Value of F=3x-4y (0,0) 3x0-4x0=06 Maximum (6,12) 3x6-4x12=-30 (6,16) 3x6-4x16=-46 (4) 3x0-4x4=-16 Hence, maximum of F=0