For a maximization integer linear programming problem, a feasible solution is ensured by rounding ________ non-integer solution values if all of the constraints are the less-than-or-equal-to type.
A) up and down
B) up
C) down
D) up or down

Question

Quizplus · Accepted Answer

When all constraints are less-than-or-equal-to, rounding down non-integer solution values ensures a feasible solution. This is because by rounding down, we are reducing the non-integer value closer to the feasible region, which guarantees that it will still satisfy all constraints. Rounding up or rounding both up and down may lead to infeasibility.

For a Maximization Integer Linear Programming Problem, a Feasible Solution