Solve the following ILP by branch and bound. On one page of your solution, show the branch - and - bound tree in which subproblems are numbered 0 , 1 , 2 , and so on . Clearly label each subproblem to show the order in which the subproblems are solved.
max, 74x1+68x2+28x3,+44x4,+98x5
. . 19x1+9x2+3x3,+9x4,+11x5≤30,
x binary, AAi = 1 , 2 , ..., 5 ,