An Integer Programming (Minimization)problem Was First Solved as a Linear

Multiple Choice

An integer programming (minimization) problem was first solved as a linear programming problem,and the objective function value (cost) was $253.67.The two decision variables (X,Y) in the problem had values of X = 12.45 and Y = 32.75.If there is a single optimal solution,which of the following must be true for the optimal integer solution to this problem?

A) X = 13 Y = 33
B) X = 12 Y = 32
C) The objective function value must be less than $253.67.
D) The objective function value will be greater than $253.67.
E) None of the above