The Convex Polygon Theorem states that the optimum (maximum or minimum) solution of a LLP attains at least one of the ___________ of the convex set over which the solution is feasible.
A.Origin
B.Corner points
C.Centre
D.Edge

Hint: A convex polygon is in which no line segment between two points on the boundary ever goes outside the polygon

Complete step-by-step answer:
The Convex Polygon Theorem states that the optimum (maximum or minimum) solution of a LLP is attained at least one of the corner points of the convex set over which the solution is feasible.
 In a convex polygon, all interior angles are less than or equal to 180 degrees, while in a strictly convex polygon all interior angles are strictly less than 180 degrees.
The polygon is entirely contained in a closed half-plane defined by each of its edges.
So the correct answer is option B.

Note: A bounded feasible region will have both maximum and minimum value of the objective function. For each edge, the interior points are all on the same side of the line that the edge defines.The angle at each vertex contains all other vertices in its edges and interior.