The Branch-And-Bound Algorithm Starts by

Multiple Choice

The branch-and-bound algorithm starts by

A) relaxing all the integrality conditions in an ILP and solving the resulting LP problem.
B) relaxing all the RHS values in an ILP and solving the resulting LP problem.
C) solving two LP problems in which X₁ is set at 0 and 1 respectively.
D) determining the most likely RHS values and solving for them.