The B & B algorithm solves ILP problems
A) by solving for each variable separately.
B) by solving for the integer variables first.
C) by solving a series of LP problems.
D) by solving smaller ILP problems.

Question

Quizplus · Accepted Answer

The B & B (Branch and Bound) algorithm solves an ILP (Integer Linear Programming) problem by solving a series of LP (Linear Programming) problems, where each LP problem is a relaxation of the original ILP problem. The algorithm starts by solving the LP relaxation of the ILP problem, which provides a lower bound on the optimal value. Then, it branches into subproblems by selecting one variable and creating two subproblems, one where the variable is fixed to its upper bound, and one where the variable is fixed to its lower bound. The algorithm then repeats the process on each subproblem until it finds the optimal solution, which is guaranteed to be integer. Therefore, the best choice is C.

The B & B Algorithm Solves ILP Problems