It is a question in system engineering operation research and linear programming

Example 1.4 (Optimization Problem) Given a collection M = {1,. , m} of music titles with length l; for i e M and CD's of capacity L. Find the minimum number k of CD's to burn all titles exactly once. villlimum un Stable Set Problem for G. Exercise 3.1 Reconsider the optimization version of the CD problem from Exp. 1.4 and the following instance with CD capacity L= 8 and the following collection M of music titles: 1234 li 3 42 (a) Classify its problem type. (b) Determine the family F C 2M of all feasible subsets. Which type of set family is F? (c) Write down explicitely both the ILP formulation suggested in Exp. 1.3 and the ILP formulation according to the general problem type. (d) Enumerate all possible solutions for both formulations and discuss advan- tages and disadvantages of them. Example 1.4 (Optimization Problem) Given a collection M = {1,. , m} of music titles with length l; for i e M and CD's of capacity L. Find the minimum number k of CD's to burn all titles exactly once. villlimum un Stable Set Problem for G. Exercise 3.1 Reconsider the optimization version of the CD problem from Exp. 1.4 and the following instance with CD capacity L= 8 and the following collection M of music titles: 1234 li 3 42 (a) Classify its problem type. (b) Determine the family F C 2M of all feasible subsets. Which type of set family is F? (c) Write down explicitely both the ILP formulation suggested in Exp. 1.3 and the ILP formulation according to the general problem type. (d) Enumerate all possible solutions for both formulations and discuss advan- tages and disadvantages of them