Question: Q1) In the next B&B tree for a maximization problem with X1 and X2 are integer variables, one of th following statement is correct LPO

Q1) In the next B&B tree for a maximization

Q1) In the next B&B tree for a maximization

Q1) In the next B&B tree for a maximization problem with X1 and X2 are integer variables, one of th following statement is correct LPO Z=22.6 x1=3.2, x2=4.6 LP1 Z=21.2 x1=3, x2=4.3 Z=19 x1=4, x2=4 LP2 LP4 LP3 Z=18 x1=2, x2=5 Z=17 x1=2.5, X2=4 A) Node LP4 must not be fathomed B) The optimal objective value is 18 C) The optimal objective value is 19 D) The optimal objective value is not found yet, because LP4 node needs to be br and better solution might be found Q2) In the previous B&B tree, one of the following statement is correct A) On the branch between LPO and LP1, a constraint x1 >= 4 is added B) On the branch between LPO and LP2, a constraint x1 >= 4 is added C) On the branch between LP1 and LP3, a constraint x2 >= 4 is added D) On the branch between LP1 and LP4, a constraint x2 = 4 is added B) On the branch between LPO and LP2, a constraint x1 >z 4 is added C) On the branch between LP1 and LP3, a constraint x2 >= 4 is added D) On the branch between LP1 and LP4, a constraint x2 = 4 is added B) On the branch between LPO and LP2, a constraint x1 >= 4 is added C) On the branch between LP1 and LP3, a constraint x2 >= 4 is added D) On the branch between LP1 and LP4, a constraint x2 = 4 is added B) On the branch between LPO and LP2, a constraint x1 >z 4 is added C) On the branch between LP1 and LP3, a constraint x2 >= 4 is added D) On the branch between LP1 and LP4, a constraint x2

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!