Q: Suppose you develop and solve an integer programming model with a cost$-$minimization objective. Assume the optimal solution yields an objective cell value of $$500,000.$ Now, consider the same linear optimization model without the integer restrictions. That is$,$ suppose you drop the requirement that the decision variable cells be integer$-$valued and reoptimize with Solver. How does the optimal objective cell value for this modified model $($called the LP relaxation of the IP model$)$ compare to the original total cost value of $$500,000?$ Explain your answer.