Question: Return to the knapsack problem of Exercise 12-29. (a) Explain why LP relaxation optimal solutions can be rounded to integer-feasible solutions by setting xn jd

Return to the knapsack problem of Exercise 12-29.

(a) Explain why LP relaxation optimal solutions can be rounded to integer-feasible solutions by setting xn jd

j=.

(b) Repeat the branch and bound computations of Exercise 12-29, this time rounding up each relaxation solution in this way to produce earlier incumbent solutions.

(c) Comment on the computational savings with rounding.

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 Operations Research An Introduction Questions!