The corner points of the feasible region for the Linear Programming Problem are , and . Let the objective function is then the minimum value of the objective function occurs at
Previous Year Questions · Question 9 of 37
The corner points of the feasible region for the Linear Programming Problem are (0,2),(3,0),(6 , 0),(6,8) and (0,5) .
Question 91 markMCQAsked 2023Easy
Select your answer
(A) only
(B) only
(C) The mid-point on the line segment joining the points and
- Correct answer
(D) Any point on the line segment joining the points and
Answer: (D)
We are given the objective function:
The corner points of the feasible region are:
Now evaluate at each corner point:
| Corner Point | Value of |
|---|---|
The minimum value of is:
This minimum occurs at both:
Since the objective function has the same minimum value at two adjacent corner points, it will have the same minimum value at every point on the line segment joining those two points.
Therefore, the minimum occurs at:
So the correct option is:
