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

Multiple Choice

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

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