Question
Mathematics Question on Linear Programming Problem and its Mathematical Formulation
The objective function of L.L.P. defined over the convex set attains its optimum value at
A
none of the corner points
B
at least two of the corner points
C
all the corner points.
D
at least one of the corner points.
Answer
at least one of the corner points.
Explanation
Solution
Let Z = ax+by be the objective function
When Z has optimum value (maximum or minimum), where the variables .x and y are subject to constraints described by linear inequalities, this optimum value must occur at a corner points of the feasible region.
Thus, the function attains its optimum value at least one of the corner points.