Let R be the feasible region (convex polygon) for a linear programming problem and let,
Z = + be the objective function. When Z has an optimal value (maximum or minimum), where the variables and are subject to constraints described by linear inequalities, this optimal value must occur at ____________of the feasible region.
corner point
This is the corner point theorem