Page 1 of 1
Using the Branch-and-Bounds method, find a solution to the following instance of the Knapsack Problem: maximise subject
Posted: Thu Jul 14, 2022 2:07 pm
by answerhappygod
- Using The Branch And Bounds Method Find A Solution To The Following Instance Of The Knapsack Problem Maximise Subject 1 (55.66 KiB) Viewed 12 times
Using the Branch-and-Bounds method, find a solution to the following instance of the Knapsack Problem: maximise subject to z=16x1+10x2+16x3+30x4+30x54x1+2x2+8x3+10x4+5x5x1,x2,x3,x4,x5=0 or 1≤20 Use the ratio choice method to obtain solutions to the LP relaxations of the corresponding IP problems. Provide all the details and explanation, and draw a Branchand-Bounds tree of sub-problems for the solution process.