JOY leather, a manufacturer of leather Products, makes three types of belts A, B and C which are processed on three machines M1, M2 and M3. Belt A requires 2 hours on machine (M1) and 3 hours on machine (M2) and 2 hours on machine (M3). Belt B requires 3 hours on machine (M1), 2 hours on machine (M2) and 2 hour on machine (M3) and Belt C requires 5 hours on machine (M2) and 4 hours on machine (M3). There are 8 hours of time per day available on machine M1, 10 hours of time per day available on machine M2 and 15 hours of time per day available on machine M3. The profit gained from belt A is birr 3.00 per unit, from Belt B is birr 5.00 per unit, from belt C is birr 4.00 per unit. What should be the daily production of each type of belt so that the profit is maximum?
a) Formulate the problem as LPM
b) Solve the LPM using simplex algorithm.
c) Determine the range of feasibility, optimality and insignificance
d) Interpret the shadow prices