Question: Solve the following integer linear program using branch-and-bound with Best-First Search. Branch on 21 first. Show the branch-and-bound tree. You may solve the LP sub-problems
Solve the following integer linear program using branch-and-bound with Best-First Search. Branch on 21 first. Show the branch-and-bound tree. You may solve the LP sub-problems by any means.
min 3x14x2+5x3
s.t. 1+2+3?5
T32x22
21+4x24
T1, T2, T3 EZ,>0
Step by Step Solution
3.42 Rating (155 Votes )
There are 3 Steps involved in it
BranchandBound Tree Level 1 Branch on x1 Node 1 x1 0 x2 0 x3 5 Node 2 x1 1 x2 0 x3 4 Lev... View full answer
Get step-by-step solutions from verified subject matter experts
