PEC ae Graphical Method in Linear Programming Questions Latest Graphical Metho lear Programming MCQ Objective Questions a CR ABS Lhe li) Start Complete Exam Preparation Cec Dan a eo Clee one) Mock Tests La cs Cree neo ExT Jownload App Question 1: View this Question Online > In an LPP, if the objective function Z = mx + ny has the same maximum value on the two comer points of the feasible region and these two comer points are lying on the same line segment of the constraint then the number of points at which Zmax occurs is? . Infinite 3. Finite 4. More than one of the above . None of the above Answer (Detailed Solution Bolow) Option 2 = InfiniteTd Graphical Method in Linear Programming Question 1 Detailed Solution Concept: + The corner points of the feasible region are the points for which we need to check the value of the objective function. + The maximum value of the objective function for these comer points of the feasible region will be the optimal feasible point(s). + In case if the objective function Z = mx ~ ny has the Same maximum value cn the two comer points of the feasible region and these two corner points are lying on the same line segment of the constraint then the number of points at which Zmax occurs will be infinite. Calculation: Given: The objective function Z = mx + ny has the same maximum value on the two corner points of the feasible region. + Referring to the given example of the feasible region drawn with the feasible region shaded as, x+y=10 + The corner points of the feasible region are: C(15, 15), B(S, 5), M(10, 0) and Ni60, 0) + There is no change in corner points occurs due to extra constraints.(Corner Points of feasible |, region Ici15, 15) led 1B(5, 5) l20} IMc1ao) Lidl IN(60, 0) kd + The maximum value of x + 3y will occur at two points C and N. + Now check whether there is a possibility of multiple solutions. + For that join the points C and N. If the points C and N are lying at the same line segment CN so for all the points on that line segment CN, the value of the objective function will be a maximum of 60. + Since corner points C and N are lying on the same line segment CN so , at every point on the line segment CN, we will get the maximum value of the objective function. + So, the correct answer is option 2. & ee eee Start Complete Exam Preparation Cerin Gee eee eee Pecans oresieoc cad Exes) Question 2: View this Question Online > Maximize z = 4x + 6y subject to 3x4 2y<12x+y22xy20 1, 24.at (6,0) 2. 36 at (0, 6) 3. 24 at (0, 4)re than one of the above 5. none of the above Answer (Detailed Solution Below) Option 2: 36 at (0, 6) Graphical Method it Linear Programming Question 2 Detailed Solution Given: The objective function z = 4x + 6y The constraints are - 3x + 2y < 12, xty22, andx y= 0 = oo The maximum or minimum value of a function occurs at one of the corner oN region, Solution: Making the graph of the constraints - Noe ey Ke? We see that the feasible region has corner points (0, 2), (2, 0), (4, 0) and (0, 6) The values of the objective function z = 4x + 6y at these points respectively are 12, 8, 16 and 36 Hence maximum value occurs at (0, 6) and is equal to 36& India's #1 Learning Platform Start Complete Exam Preparation RCC Sc riod peer inetes M Xora) ore sina Download App Question 3: View this Question Online > Consider the linear programming problem (LPP) maximize z= 3x + 5y Subject to x + Sy = 10 2x4 2y <5 x2 0y20. 1. The LPP does not admit any feasible solutions. 2. There exists a unique optimal solution to the LPP 3. There exists a unique optimal solution to the dual problem. 4, The dual problem has an unbounded solution. Answer (Detailed Solution Below) Option? Graphical Method in Linear Programming Question 3 Detailed Solution Explanation: Given linear programming problem (LPP) is maximize z = 3x + 5y Subject to x+5y<10 ax+2y<5x20y20 Then feasible region is OABO where O(0, 0}, A(2.5, 0), B(0, 2.5) Zo(o, 0) = 0 Zaes 0) = 75; Zog.25 = 12.5 So Z is maximum at (0, 2.5) and the maximum value is 12.5 Hence (2) is correct and (1) is false Now, the dual problem of the given LPP is of Minimize W = 10a + 5b Subject to: a + 2b 2 3,5a+2b25,a20b20 ‘o° ayo Now,a+2b=353 7 +5 =1 KS app andSa+2b=5=4 + 25 =1 Then the feasible region is PRP where P(1, 0), QG, 0) and solving a + 2b = 3 and Sa + 2b = Swe get R(0.5, 1.25) Now, Wec1, ¢) = 10, Waa.o; = 30, Waas, 125) = 11.25 out of which 10 is minimum So dual LPP has a minimum value of 10 at (1, 0) Hence There exists a unique optimal solution to the dual problem. (3) is correct and (4) is false2 eRe aL eis @ Trusted by 1,06,00,449+ Student Start Complete Exam Preparation rere a Download App Ex iGiren: ae edheen Question 4: View this Question Online > A company manufactures two products x and y. Profit contribution is Rs 3 and Rs. 4 per unit respectively. They require 4 machines A. B, C, and D, following table explain the constraints of q facilities. Time in Hours Total Machines available x y hours A 5 4 200 B 3 5 150 © 5 4 100 D 8 4 80 Quantity of x and y produced for maximum profit are? (10, 0) = 2. 62.70)(80, 10) 4. (0, 20) 5. None of the above/More than one of the above. Answer (Detailed Solution Below) Option 4: (0,20) Graphical Method in Linear Programming Question 4 Detailed Solution Concept: Draw the constraints to find the feasible region: + To draw the inequalities, first, draw the equation form of the inequalities. + Now check the region which we have to choose depending on the sign of inequality. + To check which region we need to choose put (0,0) in both the inequality. and check whether this inequality is satisfying or not. + If itis satisfying the inequality then take the region containing t (0,0) else the opposite side of (0,0). Calculation: Given: Max Z = 3x + 4y 5x + 4y < 200 (1) 3x + 5y < 150 (2) 5x + 4y < 100 @) 8x + 4y < 80 4 of + From equations (1) and (3), we get that equation (1) is the redundant e: Oo + The graphical representation of the problem is given below x+ Hence, the point for the optimal solution is (0,20) as we get the optimum value of the objective function at this point. eN Tee erat Start Complete Exam Preparation Caen Reet ical Pea eed ae os chen resets DB Download App Question 5: View this Question Online > Maximize z = 4x + 6y subject to 3x + 2ys12x+y22x%y20 1, 24.at (6,0) 2. 36 at (0, 6)3. 24 at (0, 4) vn 4.16 eo ‘ot Attempted Answer (Detailed Solution Below) Option 2: 36 at (0, 6) Graphical Method in Linear Programming Question § Detailed Solution Given: The objective function z = 4x + 6y The constraints are - 3x4 2y < 12, xty22, andx, y > 0 Concept: The maximum or minimum value of a function occurs at one of the corner points of the «@O region, Solution: Making the graph of the constraints - 0° We see that the feasible region has corner points (0, 2), (2, 0), (4, 0) and (0, 6) The values of the objective function z = 4x + 6y at these points respectively are 12. 8. 16 and 36Hence maximum value occurs at (0, 6) and is equal to 36 Top Graphical Method in Linear Programming MC@Q Objective Questions CE RR A Re Rel) Start Complete Exam Preparation Dee oat (8) Pe (ee Peace Des chen oresieuccag & Quizzes Jownload App Question 6 View this Question Online > Consider the given problem: 5x+y <100 ...(1) x+y<60 x20 .@) y20 (4) , If we solve the above linear equations by the graphical method of Linear Programming, then the following point___ will not form the the boundary of the feasible region. 1. 0,0) * » 3. (0, 60) 4, (10,50) Answer (Detailed Solution Below) Option 1: (60, 0) Graphical Method in Linear Programming Question 6 Detailed Solution Explanation: ——a a a a a a ee On comparing the inequality with (0,0) and shading the common area We get the feasible region as follows, Hence we can easily conclude that point (60,0) and (0,100) are outside the feasible region. Ascliticneltafersection Points outside the feasible region do not contribute to the objective function. India's #1 Learning Platform CoC Seca Start Complete Exam Preparation Ex iz 2) ee ered cligeeiies MasterClass resieaccg Download App ‘Question 7 View this Question Online > Consider the following Linear Programming Problem (LPP). Maximise Z = x; + 2x2 Subject to: xy <2 Xp S2 xy +X <2 xy, Xp 2 0 (ie. +ve decision variables) What is the optimal solution to the above LPP?ager A. Answer (Detailed Solution Below) Option 2: 0,2 Graphical Method in Linear Programming Question 7 Detailed Solution Calculation Given Objective function Maximize, Z=X4 + 2X2 Constraints Xp +Xp 22. Non neagative constarints Xy Xp 20 The above equations can be written as, x B<1(4) % <1(5) He ges 1(6) Plot the above equations on X} ~ Xp graph and find out the “o oeNow, find out the value of the objective function at every extreme point of solution space. Zo=0+2%0=0 Zy=042%2=4 Zy=2+2x0=2 Since the value of the objective function is maximum at A. There A (0, 2) is the optimal solution. & CR ARR hell Start Complete Exam Preparation Pagar pence Gir ees eC ar aeeea Download App Question & View this Question Online > The value of (x1, x2) for an optimal solution for Minimize Z = 6x, — 8x) Subject to 5x1 + 10x < 30 4X1 + 4x) < 20 X12 0,% > 0is 1.0.0) . % 2. (1, 6VO 4.67) Answer (Detailed Solution Below) Option 3: (0, 3) Graphical Method in Linear Programming Question 8 Detailed Solution xy+2Q=6 __(1) nO 2x, +2x.=10 __(2) & On subtracting equation (1) from equation (2): Xe 2x xy = 4 xy=4 x2 Corner point of feasible region are (0, 0), (0, 3), 4, 1), 6, Z(0,0)=0 Z (0,3) =-24 Z(4,1) = 24-8 = 16 Z(5,0) = 30-0 x 30= 30 (0, 3) = -24 minimum valueCR ABR Rel) Start Complete Exam Preparation Cpe coe [_ ] Mock Tests ecto aeeny Question Bank Perres Download App Re Aoi Question 9 Maximize Z = 15X; + 20Xp subject to 12K + 4X = 36 12Xq — OX < 24 XX z0 The above linear programming problem has 1. infeasible solution 2. unbounded solution 3. alternative optimum solutions 4. degenerate Solution Der ocd Solution Below) Option 2: unbounded solution View this Question Online > Graphical Method in Linear Programming Question 9 Detailed Solution Concept: Zmax = 15X1 + 20x2 Constraint: 12x, + 4x 236 © -~(1) 12x; - 61g $24 ---(2)Xy XQ ZU From eq (1): 12x; + 4x2 = 36 Atxt = 0x2 =9 Xp = 0.x, =3 (0, 9) and (3, 0) From eq (2): 12x; ~ 6x2 = 24 Atxy = 0x9 = -4 Xp = 0.x, =2 (0, -4) and (2, 0) Draw these points on graph. y (0,.9)% Feasible S RegionS ~: Feasible region is not bounded here so above linear programming problem hes unbounded solution. ERE ae eon Retell eee Start Complete Exam Preparation peo ere ioe cl Cree ieo coo Cie: ce oe erosD Download App Question 10 View this Question Online > Maximize Z = 2X1 + 3X Subject to 2X1 +X <6 =X) 23 XX 20 The solution to the above LPP is 1. optimal 2. infeasible & a. 3. unbounded 4, degenerate a Answer (Detailed Solution Below) Option 1: optimal Graphical Method in Linear Programming Question 10 Detailed Solution Concept + In order to find the maximum value of the objective function, the constraints of the objective function are drawn and the region formed by the constraints is the feasible region. Draw the constraints to find the feasible region: + To draw the inequalities, first, draw the equation form of the inequalities. + Convert all the constraints to equality and piot on the graph. Put the value of (%, x2) obtained from the corner points of the feasible region and put it in the objective function. + Now check the region which we have to choose depending on the sign of inequality. + To check which region we need to choose put (0,0) in both the inequality. and check whether this inequality is satisfying or not. + Ifit is satisfying the inequality then take the region containing t (0,0) else the opposite side of (0,0).b eeatacorsigicisied Given: + Following cases are observed by the region formed by the constraints Calculation: Given: + The objective function to maximize is, Z= 2X + 3X2 + Which is subjected to the constraints, 2X1 +X <6 X1-Xp 23 XX 20 + If the given constraints are drawn coh cen, + The feasible region is a point here, therefore the given LPP has an optimal solution and it will occur at point (3, 0). eee acy Start Complete Exam Preparation CCE Sos ce} Pont oad es MasterClass researc Extiz 7)Question 11 A firm uses a turning center, a mi \View this Question Online > g center and a grinding machine to produce two parts. The table below provides the machining time required for each part and the maximum machining time available on each machine. The profit per unit on parts | and Il are Rs. 40 and Rs. 100, respectively. The maximum profit per week of the firm is Rs. Machining time . required for the Maxi um Type of —|machine part (minutes)} machining time machine available per week (minutes) 1 i I Turning Center ce 6 Milling Center| 4 Grinding Machine 3 1800 ye X Answer (Detailed Solution Below] 39000 - 41000 Graphical Method in Linear Programming Question 11 Detailed Solution Given: Data for part (I) and (II) are given as: (Max. Time| available Turning 12 6 6000 Milling 4 10 4000Grinding 1800 Profit on part | is 40 and on part Il is 109. let part (I) to be x; quantity & (II) to be x quantity We have to maximum profit. s+ Max. 40x; +1002 ---(A) Subject to 12x, + 6x9 < 6000 - (1) ~ (as total processing times on individual machines must not individual maximum available time) 4x, + 10k) < 4000 ----@) ‘O° 2ny + 3x2 51800 ----(3) N oexy 2) Solving the above equation graphically (0,1000) (0,600) (0,400) (1000.0) (500,0) — (900,0) Since the z-line (maximization) is along equation (2) and maximum point on this line is at (0, 400) Hence from equation A + Maximum profit = 40 x; + 100 x2 s Maximum profit = (40 x 0) + 100 x (400) = Maximum profit = 40,000.eee iro) Ren rca Clee Cea CHima cele) eee Oke cee Does cielo Extra) Download App resinous Question 12 View this Question Online > The minimum value of 3x + Sy Such that: 3x+5ys15 Ax+dys8 ~~ ay s2 y20 is Answer (Detailed Solution Below) 0 Graphical Method in Linear Programming Question 12 Detailed Solution Concept: The minimum value can be obtained by the following steps ot the constraints graphically : Obtain the feasible region (the region which is common for all the constraints) + Step3: Checking for the minimum value at the corner points, the point where minimum value occurs is the optimum point. Calculation: To minimize (3x + 5y) Given 3x+5y <5SEES et 13x + 2y<2 x20y20 13x 42y =2 Now fram the figure itself we use (A B C D) is the feasible reason clearly as we have to minimize (3x +5y). The minimum will occur at [x = 0 and y = 0] point A = 3x + Sy = 0 Minimum and in all rest cases as x > 0, y 2 0 [3x + 5y > 0] Hence at (0, 0) 3x + Sy is minimum Mistake: Keep in mind that the minimum value is asked not maximum. So don’t get confused otherwise at point (c) maximum will occur and the answer will be different which is incorrect. India’s #1 Learning Platform Ree D a cesta Start Complete Exam Preparation lee ed es Does holon resinous Download App Question 13 View this Question Online > Two models, P and Q, of a product earn profits of Rs.100 and Rs.80 per piece, respectively. Production times for P and Q are 5 hours and 3 hours, respectively, while the total production time available is 150 hours. For a total batch size of 40, to maximize profit, the number of units of P to be produced is Answer (Detailed Solution Below) 15oY Graphical Method i gramming Question 13 Detailed Solution XO the units of P and y are the unit of Q. jective function Max. Z = 100x + 80y Subjected to constraints 5x + 3y < 150 x+y 40 x x+y <40 Oo 5x + 3y < 150 no? Shaded region is the feasible region. “a OSD coordinates of B. As Bis intersection of x+y=40 5x + 3y = 150 On solving these coordinates of B is (15, 25) Now, finding value of objective function at all corner points ZIA) = Z(0, 40) = 3200 Z@) = Z(15, 25) = 3500 Z(C) = ZO, 0) = 3000 Z(O) = Z(0, 0) = 0 So Maximum value is at B (15, 25). The no. of units of P is 15GER ABS Rela) Start Complete Exam Preparation irene coe eens Des cien es eco’ Download App Gas Ree Question 14 Consider the following linear programming (LP): Max. Z = 2x; + 3xp Such that 2x; +x) <4 Xt + 2xpesiS. x.. ‘optimum value of the LP is 1, 23 Answer (Detailed Solution Below) CCAS eo View this Question Online >Option 4:8 Graphical Method in Linear Programming Question 14 Detailed Solution The correct answer is option 4. Max Z=2xy +3x2 antes xy + 2g 35 x20 Graphical method, 2 ne ™ (0, 5/2) (1,2) x1 (0, 0) (2,0) (5, 0) Draw lines by removing inequality Z at (1,2) =2+6=8 Zat (2,0) =4+0=4 Zat (05/2) =0+15:2=75 = Hence the correct answer is 8. © Hint The smart way to answer as per the given options India's #1 Learning Platform STS yy ey aren Start Complete Exam Preparation Gee: oe ah Care Cree aero— Question 15 View this Question Online > The graphical method is i Q8 linear programming problems with variables, Answer (Detailed Solution Below) co ¢ Option 4:2 NA Graphical Method it Explanatior e2 Linear Programming Protlems in x system process of finding a maximum or minimum value of any variable in n, itis also known as the optimization problem. Linear Programming i iled Solution Graphical method: The graphical method of solving a linear programming problem can be used when there are only two decision variables. if the problem has three or more variables, the graphical method is not suitable. Decision variables are changeable & going to impact the decision function.