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
If there is a single optimal solution, 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) 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
C
Business
You might also like to view...
Many routine requests have several parts. Identify and discuss best practices for explaining and justifying a routine request
What will be an ideal response?
Business
Which of the following is NOT a basic section in a typical marketing plan?
A) marketing situation B) forecasting C) measurement and controls D) financial overview E) executive summary
Business