Slide45.JPG Slide46.JPG Slide47.JPG

Share on WhatsApp

🎉 Smart choice! You just saved 2+ minutes of ads and got straight to the good stuff. That's what being a Teachoo Black member is all about.


Transcript

Question 17 The feasible region of a linear programming problem is bounded but the objective function attains its minimum value at more than one point. One of the points is (5, 0). Then one of the other possible points at which the objective function attains its minimum value is (A) (2,9) (B) (6,6) (C) (4,7) (D) (0,0) Usually, when Z attains minimum value at more than one point It would attain minimum value at all points in the line So, that means if (5, 0) has minimum value of Z, and (5, 0) passes through red line Then all points on the red line will have minimum value of Z From our options (A) (2,9) (B) (6,6) (C) (4,7) (D) (0,0) Now, (2, 9) is on red line So, the correct answer is (A)

Davneet Singh's photo - Co-founder, Teachoo

Made by

Davneet Singh

Davneet Singh has done his B.Tech from Indian Institute of Technology, Kanpur. He has been teaching from the past 15 years. He provides courses for Maths, Science and Computer Science at Teachoo