Problem 2:

Must use LINDO. 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. Write an integer program for each of the following instances of bin packing and solve with the software of your choice. Submit a copy of the code and 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: The version of LINDO that you have access to on the OSU server has a limit of 50 integer variables. Therefore, LINDO will only be able to solve problems with at most 6 items