A manufacturer produces two types of steel trunks.He has two machines,A and B.The first type of trunk requires 3 hours on machine A and 3 hours on machine B.The second type requires 3 hours on machine A and 2 hours on machine B.Machines A and B can work at most for 18 hours and 15 hours per day respectively.He earns a profit of Rs. 30 per trunk on the first type of trunk and Rs. 25 per trunk on the second type.Formulate a Linear Programming Problem to find out how many trunks of each type he must make each day to maximise his profit.
