An integer programming (maximization)problem was first solved as a linear programming problem,and the objective function value (profit)was $253.67.The two decision variables (X,Y)in the problem had values of X = 12.45 and Y = 32.75.Which of the following must be true for the optimal integer solution to this problem?
A)X = 12 Y = 32
B)X = 12 Y = 33
C)X = 12
D)Y = 32
E)None of the above

Question

Quizplus · Accepted Answer

The optimal integer solution requires both X and Y to be integers, but rounding the LP solution values (X = 12.45, Y = 32.75) to the nearest integers (X = 12, Y = 33) may not necessarily yield the optimal integer solution.

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