MCQ
The value of objective function is maximum under linear constraints
Options
at the centre of feasible region
at (0, 0)
at any vertex of feasible region
the vertex which is maximum distance from (0, 0)
Advertisement Remove all ads
Solution
at any vertex of feasible region
In linear programming problem we substitute the coordinates of vertices of feasible region in the objective function and then we obtain the maximum or minimum value.
Therefore, the value of objective function is maximum under linear constraints at any vertex of feasible region.
Concept: Introduction of Linear Programming
Is there an error in this question or solution?
APPEARS IN
Advertisement Remove all ads