Generally,the optimal solution to an integer linear program is less sensitive to the constraint coefficients than is a linear program.

Question

Quizplus · Accepted Answer

Integer linear programs (ILPs) are generally more sensitive to changes in constraint coefficients than linear programs (LPs) because the feasible region for ILPs is discrete, and small changes can lead to different optimal solutions or make a previously feasible solution infeasible.

Generally,the Optimal Solution to an Integer Linear Program Is Less