the lp relaxation of a maximization integer linear programming (ilp) problem would represent a(n) (fill in the blank) on the optimal objective function value of the original ilp problem.