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