Rounding the solution of a linear programming problem to the nearest integer values provides a(n):
A)integer solution that is optimal.
B)integer solution that may be neither feasible nor optimal.
C)feasible solution that is not necessarily optimal.
D)infeasible solution.

Question

Quizplus · Accepted Answer

Rounding the solution of a linear programming problem to the nearest integer values can result in a solution that is neither feasible (does not satisfy all the constraints of the problem) nor optimal (not the best solution in terms of the objective function). Linear programming solutions are continuous by nature, and rounding can disrupt the delicate balance of constraints and optimality.

Rounding the Solution of a Linear Programming Problem to the Nearest