Question 9 (Case Based MCQ) - NCERT Exemplar - MCQs - Chapter 12 Class 12 Linear Programming (Term 1)

Last updated at Nov. 20, 2021 by Teachoo

Hello! Teachoo has made this answer with days (even weeks!) worth of effort and love. Since your board exams are coming, why not help Teachoo create more videos and content by supporting us? Please click on this link to make a donation

Corner points of the feasible region for an LPP are (0, 2), (3, 0), (6, 0), (6, 8) and (0, 5).

Let F = 4x + 6y be the objective function.

The Minimum value of F occurs at

(A) (0, 2) only

(B) (3, 0) only

(C) the mid point of the line segment joining the points (0, 2) and (3, 0) only

(D) any point on the line segment joining the points (0, 2) and (3, 0).

Hello! Teachoo has made this answer with days (even weeks!) worth of effort and love. Since your board exams are coming, why not help Teachoo create more videos and content by supporting us? Please click on this link to make a donation

Question 9
Corner points of the feasible region for an LPP are (0, 2), (3, 0), (6, 0), (6, 8) and (0, 5).
Let F = 4x + 6y be the objective function.
The Minimum value of F occurs at
(A) (0, 2) only
(B) (3, 0) only
(C) the mid point of the line segment joining the points (0, 2) and (3, 0) only
(D) any point on the line segment joining the points (0, 2) and (3, 0).
We need to find Max F = 4x + 6y
Corner Points are
(0, 2), (3, 0), (6, 0), (6, 8), (0, 5)
Checking value of F at corner points
Since minimum occurs at 2 points,
∴ Z is minimum on all points joining (0, 2) and (3, 0)
So, we can say that
Z is minimum at any point on line segment joining points (0, 2) & (3, 0).
So, the correct answer is (D)

Made by

Davneet Singh

Davneet Singh is a graduate from Indian Institute of Technology, Kanpur. He has been teaching from the past 12 years. He provides courses for Maths and Science at Teachoo.