Answer:
Maximum profit is $87 when 3 blenders and 11 mixers are produced.
Step-by-step explanation:
let blender is represented by
and and mixer by
.
total time to deliver parts = 24 hrs
total time to assemble = 30 hrs
time taken by each blender to deliver parts = 1 hr
time taken by each mixer to deliver parts = 2 hr
time taken by blenders in final assembling= 2 hr
time taken by mixers in final assembling = 3 hr
Each blender produced nets the firm= $7
Each mixer produced nets the firm= $6
Using this all data linear system of equation will be:

profit function:


Coordinate points obtained from (1) are (0,12) and (24,0)

Coordinate points obtained from (2) are (0,10) and (15,0)
plotting these on graph
points lying in feasible region are:
A(0,0)
B(0,10)
C(3,11)
D(12,0)
substituting these points in (3) to find the maximum profit:
for A (0,0)
z = 0
for B (0,10)
z = 60
for C (3,11)
z = 87
for D (12,0)
z=84
So maximum profit is $87 when 3 blenders and 11 mixers are produced.