Question: Please use the branch-and-bound algorithm to solve the following problem. At each iteration, you can use either Excel Solver or AMPL to solve the LP
Please use the branch-and-bound algorithm to solve the following problem. At each iteration, you can use either Excel Solver or AMPL to solve the LP relaxation problem.
Minimize 7X1+3X2+2X3
subject to:
8X1+5X2+4X321
4X1+2X2+7X318
6X1+3X2+2X335
7X1+6X2+4X357
X1, X2, X30 and integer
(You only need to show me the completed enumeration tree. If you want to, you can draw the enumeration tree on paper, take a picture of it, and insert the picture into this Word document.)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
