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

Problem $\mathrm{A}$ is a two-variable linear programming problem with a minimization objective function. Problem B is a two-variable mixed integer programming problem obtained from Problem A by requiring one of the variables to be integer and leaving all other things unchanged. Assuming that both problems have optimal solutions and that Problem A has a unique non-integer optimal solution, 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