A bag workshop produces suitcases and backpacks. While producing these products, T1, T2, and T3 machines are used. While the backpack is being produced, T1 machine takes 2 hours, T2 1 hour and T3 1 hour, baggage while producing, T1 must work for 1 hour, T2 for 2 hours, and T3 for 1 hour. Monthly working hours of these machines are maximum 180, 160 and 100 hours respectively. It must produce at least 10 pieces of luggage. Workshop tread 40TL from his bag and 60TL from his suitcase. The linear programming model that shows how much of each type of garment the firm needs to produce to maximize profits is given below. 1 = number of backpacks 2 = number of suitcases

max = 401 + 602

21 + 2 180

1 + 22 160

1 + 2 100

2 10

1, 2 0

a) Solve the problem graphically, determine the binding and non-binding constraints, and interpret all the results you find. b) How do you change the problem so that it becomes an alternative optimal solution? After making this change, solve the problem, determine and interpret the optimal amounts.