A branch and bound tree, at some stage of computation, has 5 dangling nodes. The LP solution values at these nodes are:  1) 98.5,   2) 77.3,   3) 87.6,   4) 86.3,   5) 103.4. The current incumbent solution value is 104.5. Is this a minimization problem or a maximization problem? Explain why? Which node will you select for further branching, and why? Suppose that the LP solution values for the two nodes created by branching on the selected node are 88.2 and 91.5. Furthermore, both these solutions are integral solutions. How many dangling nodes will the tree have in the next iteration. Explain your answer. The user has decided that branch and bound search  will be terminated if the current incumbent solution is guaranteed to be within 2.5% of the optimal solution. In light of this criterion, should the search be continued or stopped? Explain.

Answer rating: 100% (QA)

This problem appears to be a minimization problem since the goal is to minimize some objective funct... View the full answer