If a Maximization Linear Programming Problem Consists of All Less-Than-Or-Equal-To

Multiple Choice

If a maximization linear programming problem consists of all less-than-or-equal-to constraints with all positive coefficients and the objective function consists of all positive objective function coefficients, then rounding down the linear programming optimal solution values of the decision variables will ________ result in a(n) ________ solution to the integer linear programming problem.

A) always, optimal
B) always, non-optimal
C) never, non-optimal
D) sometimes, optimal