Question: Problem 7. Apply branch and bound to solve the following discrete optimization problem. min 7X1 + 12x; + 5X3 + l4X4 s.t. 300x1 + 600x2

Problem 7. Apply branch and bound to solve the following discrete optimization problem. min 7X1 + 12x; + 5X3 + l4X4 s.t. 300x1 + 600x2 + 500X3 + 1600X4 2 700 X1, X2, X3, X4 =00r1 Draw the branch and bound tree. Mark the order that the nodes in the tree are expanded. Annotate each node with the lower and upper bounds. Use constraint relaxation (i.e. treating each xi as a continuous variable in [0,1]), NOT Lagrangian relaxation. You may use any solver (including NEO S) to solve the relaxed subproblems. (17pt)
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
