The optimal solution to the integer linear program will be an extreme point of the
A)convex hull.
B)objective contour.
C)cutting plane.
D)slope.

Question

Quizplus · Accepted Answer

An extreme point of a convex hull is a vertex of the polytope. The optimal solution to the integer linear program is a vertex of the feasible region, which is also the convex hull of the feasible points. Therefore, it is an extreme point of the convex hull.

The Optimal Solution to the Integer Linear Program Will Be