Question: = Problem 2 (50pts). Solve the following integer program via the branch-and-bound algo- rithm using an exact tolerance ( = 0). Form the branch-and-bound tree

= Problem 2 (50pts). Solve the following integer

= Problem 2 (50pts). Solve the following integer program via the branch-and-bound algo- rithm using an exact tolerance ( = 0). Form the branch-and-bound tree and indicate the solution associated with each node, and why each node is fathomed (pruned). You can use the simplex method or a solver to solve the linear programming relaxation. If you choose to solve the LP relaxation using the simplex method, please include your calculation in the answer. If you choose to solve it using CVX, pleae include your codes and the solution output. max 2x1 + 3.22 + 4.C 3 + 7:24 s.t. = 4x1 + 6x2 2x3 + 8x4 = 20 21 + 2.62 6x3 + 724 = 10 X1, X2, X3, 24 > 0 and integers. =

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!