Question: Try using LINDO . Integer Programming. An exact solution to the bin packing optimization problem can be found using 0-1 integer programming (IP) see the
Try using LINDO . Integer Programming.
An exact solution to the bin packing optimization problem can be found using 0-1 integer programming (IP) see the format on the Wikipedia page https://en.wikipedia.org/wiki/Bin_packing_problem. Write an integer program for each of the following instances of bin packing and solve with LINDO. Interpret the results.
a) Six items S = { 4, 4, 4, 6, 6, 6} and bin capacity of 10
b) Five items S = { 20, 10, 15, 10, 5} and bin capacity of 20
Note: LINDO will only be able to solve problems with at most 6 items
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
