Let the pieces of type
A manufactured per week be
x.
Let the pieces of type B manufactured per week be y.
∴ maximum profit z=80x+120y
Fabricating hours for A is 9 and finishing hours is 1
Fabricating hours for B is 12 and finishing hours is 3
Maximum number of fabricating hours is 180.
∴9x+12y≤180
⇒3x+4y≤60
Maximum number of finishing hours is 30.
∴x+3y≤30
Thus we can formulate the Linear Programming Problem as follows:
maxz=80x+120y subjected to the constraints, 3x+4y≤60,x+3y≤30,x≥0,y≥0
Solving the constraints we get x=12,y=6
Now the area of feasible region is as shown in the figure.
We can see that the points bounded by the feasible region are A(0,10),B(12,6),C(20,0)
Now let us calculate the maximum profit.
At A(0,10),z=80(0)+120(10)=1200
At B(12,6),z=80(12)+120(6)=1680
At C(20,0),z=80(20)+120(0)=1600
Hence the maximum profit is at (12,6)
Therefore 12 pieces of type A and 6 pieces of type B should be manufactured per week to get a maximum profit of Rs.1680