Question 61 markMCQAsked 2024Easy
The feasible region of a linear programming problem is bounded. The corresponding objective function is .
The objective function attains in the feasible region.
Confirming your payment
Previous Year Questions · Question 6 of 37
The feasible region of a linear programming problem is bounded. The corresponding objective function is .
The objective function attains in the feasible region.
(A) only minimum
(B) only maximum
(C) both maximum and minimum
(D) either maximum or minimum but not both
Ans. Option (C) is correct.
In linear programming, when the feasible region is bounded, the objective function can attain both a maximum and a minimum value. Since the feasible region is finite, the linear objective function will reach its extreme values at the vertices of the region.
Thus, the correct answer is:
Option (C): both maximum and minimum.