Here is a complete MIP (Mixed Integer Programming) model that should do the trick. I just use some random data (weights) with 100 widgets and 50 possible bins. When solved the variable NumUsedBins gives the maximum number of bins and the variable x gives the assignment. The equation 'order' is to make sure we use lower numbered bins first. The strange statement about optcr is to tell the solver to solve to optimality (for very difficult problems you may want to stop at 5% or so).
4 of 5
Added unused bin constraint. May not strictly be needed but the solution may become more difficult to interpret.
Erwin Kalvelagen
- 281
- 2
- 6
Erwin Kalvelagen
- 281
- 2
- 6