Use the branch and bound method to find the optimal solution tothe following integer programming problem: maximize 7x1 + 3x2subject to: 2 x1 + x2 < 9 3 x1 + 2x2 <13 x1, x2 > 0; x1,x2 integer
Instead of using EXCEL Solver to solve this problem directly as aninteger programming problem, use EXCEL Solver to solve the LPproblems at each branch, with the appropriate constraints added,according to the branch and bound algorithm. Be sure to draw a nodeand branch diagram to illustrate the procedure, showing thebranches that are fathomed, noninteger variables selected, and theoptimal solution
