The Record-a-Song Company has contracted with a rising star to record eight songs. The durations of the songs are 8, 3, 5, 5, 9, 6, 7, and 12 minutes, respectively. Record-a-Song uses a two-sided cassette tape for the recording. Each side has a capacity of 30 minutes. The company would like to distribute the songs between the two sides so that the total length of the songs on each side is about the same. Formulate this problem as an integer programming problem. Clearly deﬁne your variables, objective and constraints.
I have labelled each side of the casssette X1 and X2 respectively and made them less than or equal to 30. And have also made it a minimisation problem. After this I am stuck. Please could someone help me