One approach for solving an integer linear programming problem is simply to enumerate all feasible points and select the one yielding the "best" value for the objective function.However, the number of feasible integer points is usually so large, even for small problems, that this approach is inefficient for solving most models even with a computer.

Question

Quizplus · Accepted Answer

Enumerating all feasible points is not a practical approach for solving most integer linear programming problems due to the large number of possible integer points, even for small problems. A more efficient approach is needed, such as using specialized algorithms like branch and bound, cutting planes, or heuristics.

One Approach for Solving an Integer Linear Programming Problem Is