A company manufactures two types of novelty souvenirs made of plywood. Souvenirs of type A require 5 min each for cutting and 10 min each for assembling. Souvenirs of type B require 8 min each for cutting and 8 min each for assembling. There are 3 h 20 min available for cutting and 4 h for assembling. The profit is Rs. 5 each for type A and Rs. 6 each for type B souvenirs. How many souvenirs of each type should the company manufacture in order to maximise the profit?
Let the company manufactures x souvenirs of type A and y souvenirs of type B. We construct the following table :
TypeNumberTime for cuttingTime forProfitmachine(in min)assembling(in min)(in Rs.)Ax5x10x5xBy8y8y6yTotalx+y5x+8y10x+8y5x+6yAvailability3×60+20=2004×60=240
The profit on type A souvenirs is Rs. 5 and on type B souvenirs is Rs. 6.
Our problem is to maximize Z = 5x + 6y ...........(i)
Subject to the constraints
5x+8y≤200 .........(ii)
10x+8y≤240⇔5x+4y≤120 ......(iii)
x≥0, y ≥0 .........(iv)
Firstly, draw the graph of the line 5x+8y=200
x040y250
Putting (0, 0) in the inequality 5x+8y≤200, we have
5×0+8×0≤200⇒0≤200 (which is true)
So, the half plane is towards the origin.
Since, x,y≥0
So, the feasible region lies in the first quadrant
Secondly, draw the graph of the line 5x+4y=120
x024y300
Putting (0, 0) in the inequality 5x+4y≤120, we have
5×0+4×0≤120
⇒0≤120 (which is true)
So, the half plane is towards the origin.
On solving equations 5x+8y=200 and 5x+4y=120, we get B(8, 20).
∴ Feasible region is OABCO
The corner points of the feasible region are O(0, 0), A(24, 0), B(8, 20) and C(0, 25). The values of Z at these points are as follows :
Corner pointZ=5x+6yO(0, 0)0A(24, 0)120B(8, 20)160→MaximumC(0, 25)150
The maximum value of Z is Rs. 160 at B(8, 20).
Thus, 8 souvenirs of type A and 20 souvenirs of type B should be produced each day to get the maximum profit of Rs. 160.