Let the no. of models of types
X1,X2 be x and y respectively.
According to the table,
Total no. of hours of required for assembling =1×x+1.5×y=x+1.5y
Total no. of hours of required for painting =0.2×x+0.2×y=0.2(x+y)
Total no. of hours of required for testing =0×x+0.1×y=0.1y
According to question,
Maximum no. of hours available for assembling=600hrs
∴x+1.5y≤600⇒2x+3y≤1200....(1)
Maximum no. of hours available for painting=100hrs
∴0.2(x+y)≤100⇒x+y≤500....(2)
Maximum no. of hours available for testing=30hrs
∴0.1y≤30⇒y≤300....(3)
The objective function is the revenue Z=50x+80y which we have to maximize against the constraints (1),(2) and (3)
Using the graphical method of LPP we first need to plot the equation of constraints and find the feasible region.
According to the graph and inequations of the constraints, the feasible region is the area formed by the line x+y=500
So, the corner points are (0,0),(0,250),(250,0)
Value of Z at (0,0): Z=50×0+80×0=0
Value of Z at (0,250): Z=50×0+80×250=20000
Value of Z at (250,0): Z=50×250+80×0=12500
So Z is maximum at x=0 and y=250