Question: Suppose a minimization integer programming problem was solved as an LP relaxation, and the objective function value was 253.67. Two decision variables had values of
Suppose a minimization integer programming problem was solved as an LP relaxation, and the objective function value was 253.67. Two decision variables had values of X1 = 12.45 and X2 = 32.75. If there is a single optimal solution, which of the following must be true for the integer solution?
A. X1 <= 12 and X2 <= 32
B. X1 >= 13 and X2 >= 33
C. X1 = 12
D. X2 = 32
E. Either A or B
F. None of the above
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
