CHAPTER 12 Linear Programming CASE STUDY / PASSAGE BASED QUESTIONS 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. The optimal value of the objective function is attained at the points Syllabus | ‘) po Introduction, related (a) on X-axis terminology such (b) on Y-axis as constraints, — (c)_ which are corner points of the feasible region ee (d) none of these optimization, differenttypes of __ (ii) The graph of the inequality 3x-+ 4y < 12is linear programming (a) half plane that contains the origin (LP) problems. (b) half plane that neither contains the origin nor the points of the line 3x + 4y creoticelmenad (©) whole XOY-plane excluding the points on line 3x + 4y = 12 of solution for problemsin two (@) None of these Variables feasible (41) The feasible region for an LPP is shown in » and infeasible : 3 regions (bounded), the figure. Let Z = 2x + Sy be the objective feasible and function. Maximum of Z occurs at oped 5 infeasible solutions, + 8) @ (7,0) 4 optimal feasible 6.3) solutions (up to (>) (6,3) 2 three non-trivial © @6) constraints). @ 4&9 (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 @) p=4 (b) p=2q © q=2» (d) q=3p(¥) ‘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 (b) ‘The quantity in column B is greater (©) The two quantities are equal (d) ‘The relationship cannot be determined on the basis of the information supplied. 9 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 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 2s 0 Based on the above information, answer the following questions. () What is the point of intersection of line J, and |). 40 50 50 40 @) (*. =) ©) ($3) (C) (= (ii) The corner points of the feasible region shown in above graph are (a) (0,25), (20, 0), (2. =) (b) (0,0), (25, 0), (0, 20) (© 0), (2 »), (0,20) (@ (0.0), 25,0), (2.3). (0.2) (iii) If Z = x + y be the objective function and max Z = 30. The maximum value occurs at point @ (2%) &) (0) (© (25,0) @ (0,20) (iv) IfZ = 6x — 9y be the objective function, then maximum value of Z is (a) -20 (b) 150 (Q) 180 (d) 20 (v) IfZ= 6x + 3ybe the objective function, then what is the (a) 120 (b) 130 oo (@ 150 imum value of Z?oO 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) (6,0) © (3) (d) 0,8) (i) Maximum value of Z occurs at (@) (5,0) (b) (0,8) © (3) (@) (6,8) (ili) Maximum of Z ~ Minimum of Z = (@) 58 (b) 68 © 78 (d) 88 (iy) ‘The corner points of the feasible region determined by the system of ? linear inequalities are i (a) (0, 0), (-3, 0), (3, 2), (2,3) (b) (3,0), 3, 2), @, 3), (0, -3) (©) (0,0), (3,0), (3, 2), (2, 3), (0, 3) (d) None of these (¥) ‘The feasible solution of LPP belongs to (a) first and second quadrant (b) first and third quadrant (©) only second quadrant (@) only first quadrant Q&—— 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 @ 360 anda manually operated sewing machine 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. (Let x and y denotes the number of electronic sewing machines and manually operated sewing machines purchased by the dealer. If it is assume that the dealer purchased atleast one of the the given machines, then {a) x+y20 (b) x+y<0 (Q x+y>0 (d) x+y<0 (i¥) Let the constraints in the given problem is represented by the following inequalities. x+yS20 360x + 240y £5760 %y20 ‘Then which of the following point lie in its feasible region. (a) (0,24) (©) 812) (© (20,2) (d) None of these (iii) If the objective function of the given problem is maximise z = 22x + 18y, then its optimal value occur at (a) (0) b) (16,0) (© 12) @) ©, 20)(iv) Suppose the following shaded region APDO, represent the feasible region corresponding to mathematical formulation of given problem. ‘Then which of the following represent the coordinates of one of its corner points. (a) (0,24) (b) (12, 8) (©) (8412) (d@) (6,14) (¥) Han 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. 6, y> 2, 2x + y> 10, x20, y> 0” redundant constraints are (@) x>6y 22 (b) 2x+y 210,42 0,y 20 © x26 (@ none of these (Av) The feasible region for a LPP is shown shaded in the figure. Let Z = 3x - 4y be the objective function. Minimum of Z occurs at (@) (0,0) (b) (0,8) © 6,0) (@) (4,10)(¥) The feasible region for a LPP is shown shaded in the » figure. Let F = 3x — 4y be the objective function. Maximum value of F is @o fo,12) () 8 os on @ -18 HINTS & EXPLANATION: 1. (i) (€):When we solve an LPP. graphically, the Solving (i) and (ii), we get, optimal (or optimum) value of the objective function Isattained at corner points of the feasible region (ii) (d): From the graph of 3x + dy < 12it is clear that it contains the origin but not the points on the line 3x + 4y = 12 (ii) (@): The corner points of the feasible region shown in the given graph are (0.0),a25,0), »( 2,42), 3°73 ), 20). (ii) (4): Maximum of objective function occurs at (ili) (a): Here Z= x+y corner points. Corner Points Value ofZ=x+y Corner Points Value of Z= 2x + Sy (0,0) 0 (0,0) 0 (25, 0) 25 @,0) 4 50 40 63) ” (23) 30 Maximum, (4,5) 33. — Maximum, 5) 30 (0,20) 20 40 (iv) (d): Value of Z = px + qy at (15, 15) = 15p + 15q Thus, max Z= 30 occurs at point (? and that at (0,20) =20q. According to given condition, we have a ¢ 15p + 15q=20q = 15p=5q => q=3p Corner Points Value of Z = 6x- 9y (v) (b): Construct the following table of values of the (0,0) ° (25,0) 150 — Maximum objective function = Corner Point Value of Z = 4x-+ 3y 30 40 -20 (0) |4x0+3x0=0 303 (0,40) |4x0+3%40=120 (0.29) (20,40) | 4x 20+3x 40-200 ) ©: (60,20) | 4x 60+3%x20=300 < Maximum) [Corner Points Value of Z = Gx + 3y (60,0) | 4x60+3x0=240 (0,0) 0 Minimum 2. (Wi) (b):Let B(x, y) be the point of intersection of (25,0) 150 the given lines ‘2x + 5y= 100 =i) 140 and 245 = 1 8r+ 5) =20 ) 60. oy3. Construct the following table of values of objective function Corner Points Value of Z = 4x 6y 3) 4x0-6x3=-I8 (5,0) 4x5-6x0=20 (6.8) 4x6 -6x8=—24 8) 4x0 _6x8= 48 @ (@): Minimum value of Z is 48 which occurs at (0,8). (ii) (a): Maximum value of Z is 20, which occurs at 6,0). (ii) (b): Maximum of Z — Minimum of Z =20- (48) = 20 + 48 = 68 (iv) (€): The corner points of the feasible region are 0(0, 0), AG, 0), BG, 2), C(2, 3), DOO, 3). (y) @) 4 WO (W) (): Since (8, 12) satisfy all the inequalities therefore (8, 12) is the point in its feasible region. (4D (©): At (0, 0), 2=0 At (16, 0), 2= 352 AL(8, 12), 2= 392 At (0, 20), 2= 360 It can be observed that max z occur at (8, 12). Thus, z will attain its optimal value at (8, 12). (iv) (Q): Wehave, r+ y=20 and 3x+2y =48 ‘On solving (i) and (ii), we get x= 8 y= 12. ‘Thus, the coordinates of Pare (8, 12) and hence (8, 12) is one of its corner points. @ (¥) (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 isto be found. (i) (©): 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 [AB]. (iii) (b): When x2 6 and y > 2, then nt y22x6+2, ie, 2x+yz14 Hence, x= 0, y2 0 and 2x + y2 10 are automatically satisfied by every point of the region {Gx y): x26} (x,y) 222} (iv) (b): Construct the following table of values of the objective function : Corner Point Value of Z= 3x - 4y (0,0) 3x0-4%0 5,0) |3x5-4x0=15 (65) [3x6-4x5=-2 (6,8) 3x6-4x8=-14 10) |3x4-4x 10=-28 (0,8) 3x0-4%8=-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 ) 3x0-4x0=0¢ Maximum (6,12) 3x6-4x12=-30 (6,16) 3x6-4x 16=-46 @4) 3x0-4«4=-16 Hence, maximum of F=0