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₁. $\begin{array}{ll} \text { MAX: } & 35 \mathrm{X}_{1}+45 \mathrm{X}_{2} \ \text { Subject to: } & 35 \mathrm{X}_{1}+55 \mathrm{X}_{2} \leq 250 \ & 65 \mathrm{X}_{1}+25 \mathrm{X}_{2} \leq 340 \ & \mathrm{X}_{1}, \mathrm{X}_{2} \geq 0 \text { and integer } \end{array}$ Initial solution X₁ = 4.6X₂ = 1.6 Obj = 233.9

Question

Quizplus · Accepted Answer

The Answer of 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₁. $\begin{array}{ll} \text { MAX: } & 35 \mathrm{X}_{1}+45 \mathrm{X}_{2} \ \text { Subject to: } & 35 \mathrm{X}_{1}+55 \mathrm{X}_{2} \leq 250 \ & 65 \mathrm{X}_{1}+25 \mathrm{X}_{2} \leq 340 \ & \mathrm{X}_{1}, \mathrm{X}_{2} \geq 0 \text { and integer } \end{array}$ Initial solution X₁ = 4.6X₂ = 1.6 Obj = 233.9

The Following ILP Is Being Solved by the Branch and Bound