Problem $\mathrm{A}$ Is a Two-Variable Linear Programming Problem with a Maximization Objective

Multiple Choice

Problem $\mathrm{A}$ is a two-variable linear programming problem with a maximization objective function. Problem B is a two-variable pure integer programming problem obtained from Problem A by requiring the variables to be integers and leaving all other things unchanged. Assuming that both problems have optimal solutions, the objective function value of problem A will always be the objective function value of Problem B.

A) greater than
B) less than
C) equal to
D) greater than or equal to
E) less than or equal to