Compared with standard linear programming algorithms, those for treating integer linear programming problems usually are:
A)less complex due to fewer possible solutions.
B)less amenable to "what if" analysis.
C)always heuristic.
D)easier to formulate.

Question

Quizplus · Accepted Answer

Integer linear programming problems require the optimization of solutions that must be in integer form. This restriction makes the solution set smaller and more difficult to work with, often resulting in computational complexity that is much greater than that of standard linear programming problems. Additionally, the discrete nature of integer solutions makes it more difficult to make changes to the problem and analyze the impact of those changes. Therefore, integer linear programming algorithms are less amenable to "what if" analysis.

Compared with Standard Linear Programming Algorithms, Those for Treating Integer