Rounding the solution of a Linear Programming model without an integer constraint on the variables to the nearest integer values provides

Question $16$ options:

a$)$ an infeasible solution.

b$)$ an integer solution that might be neither feasible nor optimal.

c$)$ a feasible but not necessarily optimal integer solution.

d$)$ an integer solution that is optimal.