Using LINDO:

An exact solution to the bin packing optimization problem can be found using 0-1 integer programming (IP). Write an integer program for each of the following instances of bin packing and solve by using LINDO. Provide a copy of the code and the interpretation of 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