Rounding the solution of a linear programming 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 may result in a solution that is neither feasible nor optimal. This is because rounding the values may change the feasibility or optimality of the solution. Therefore, it is important to carefully analyze and evaluate the rounded solution to ensure that it is both feasible and optimal.

Rounding the Solution of a Linear Programming to the Nearest