Linear Programming - Manufacture Problem

Q1. A manufacturer makes two types of toys A and B.three machines are needed for the purpose and the time (in minutes) required for each toy on the machines is given below:[br]Types of Toys Machines[br] I II III[br] A 12 18 6[br] B 6 0 9
Linear Programming - Manufacture Problem
Each machine is available for a maximum of 6 hours per day. If the profit on each toy of type A is Rs 7.50 and that on each toy of type B is Rs 5.Find the maximum profit and show that 15 toys of type A and 30 of type B should be manufactured in a day to get maximum profit.

Information: Linear Programming - Manufacture Problem