Question: Consider the following bin packing problem. You have four items with size 4, 4, 5, 7 and the capacity ofeach bin is 10. The goal

Consider the following bin packing problem. You have four items with size 4, 4, 5, 7 and the capacity ofeach bin is 10. The goal is to find a packing plan that uses the least number of bins to contain all items.

1. Formulate an integer program to find the optimal bin packing plan.

2. Solve the LP-relaxation of the problem (i.e., set all variable as continuous variables) by Simplex method.Is there integrality gap in this problem?

Hint: the integrality gap means that you need more bins in any integer program than the LP-relaxation.

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 General Management Questions!