When using branch and bound for a maximization integer programming problem, the lower bound at the initial node can always be determined by rounding down the LP relaxation solution values regardless of the types of constraints in the problem.

Question

Quizplus · Accepted Answer

The lower bound in a branch and bound algorithm for a maximization problem is typically determined by solving the LP relaxation of the problem, not simply by rounding down the solution values. The LP relaxation allows fractional values and provides a bound on the optimal integer solution, but the process involves solving the LP, not just rounding.

When Using Branch and Bound for a Maximization Integer Programming