Question: do not use big M Problem 5: (The Branch and Bound Method) [ 20 points] The original IP problem and the corresponding B&B (partial) tree
do not use big M
Problem 5: (The Branch and Bound Method) [ 20 points] The original IP problem and the corresponding B&B (partial) tree are as follows max12x1+10x2x1=1.71,x2=2.37,Z=44.2s.t.6x1+2x215 (a) (10 points) Write down the LP problem corresponding to node 4. (b) (10 points) Which node is the next candidate for the brunching? Why? What are the branches
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
