The Objective Function for an Optimization Problem Is: Min 3x

Multiple Choice

The objective function for an optimization problem is: Min 3x - 2y, with constraints x ≥ 0, y ≥ 0. x and y must be integers. Suppose that the integer restriction on the variables is removed. If so, this would be a familiar two-variable linear program; however, it would also be an example of

A) the convex hull of the linear program.
B) a mixed-integer linear program.
C) an LP relaxation of the integer linear program.
D) a binary integer linear program.