Solved

The Following ILP Is Being Solved by the Branch and Bound

Question 12

Essay

The following ILP is being solved by the branch and bound method.You have been given the initial relaxed IP solution.Complete the entries for the 3 nodes and label the arcs when you branch on X1.
MAX: 35 X1 + 45 X2
Subject to: 35 X1 + 55 X2 ≤ 250
65 X1 + 25 X2 ≤ 340
X1,X2 ≥ 0 and integer
Initial solution
X1 = 4.6X2 = 1.6 Obj = 233.9 The following ILP is being solved by the branch and bound method.You have been given the initial relaxed IP solution.Complete the entries for the 3 nodes and label the arcs when you branch on X<sub>1</sub>. MAX: <sup>35 X</sup><sub>1 </sub><sup>+ 45 X</sup><sub>2</sub> Subject to: <sup>35 X</sup><sub>1 </sub><sup>+ 55 X</sup><sub>2 </sub><sup>≤ 250</sup> 65 X<sub>1 </sub>+ 25 X<sub>2 </sub>≤ 340 X<sub>1</sub>,X<sub>2 </sub>≥ 0 and integer Initial solution X<sub>1 </sub>= 4.6X<sub>2 </sub>= 1.6 Obj = 233.9

Correct Answer:

verifed

Verified

Unlock this answer now
Get Access to more Verified Answers free of charge

Related Questions

Q8: A company needs to hire workers

Q9: What are binary integer variables?<br>A)Variables with any

Q16: A company produces three products which

Q26: The setup cost incurred in preparing a

Q44: The concept of an upper bound in

Q46: Pure IP formulation requires that:<br>A) all decision

Q56: Binary variables are useful for modeling<br>A) the

Q92: How are general integrality requirements indicated in

Q93: One approach to solving integer programming problems

Q94: The concept of a lower bound in