The solution to the LP Relaxation of a maximization integer linear program provides
A) an upper bound for the value of the objective function.
B) a lower bound for the value of the objective function.
C) an upper bound for the value of the decision variables
D) a lower bound for the value of the decision variables

Question

Quizplus · Accepted Answer

The LP relaxation of an integer linear program removes the integer constraints, potentially increasing the objective function value, thus providing an upper bound for the integer program's objective function.

The Solution to the LP Relaxation of a Maximization Integer