H(x) = -0.5x16 + 14x2 – 2 + 254
1 answer:
You might be interested in
Answer:
The maximum profit is reached with 4 deluxe units and 6 economy units.
Step-by-step explanation:
This is a linear programming problem.
We have to optimize a function (maximize profits). This function is given by:
being D: number of deluxe units, and E: number of economy units.
The restrictions are:
- Assembly hours:
- Paint hours:
Also, both quantities have to be positive:
We can solve graphically, but we can evaluate the points (D,E) where 2 or more restrictions are saturated (we know that one of this points we will have the maximum profit)
The maximum profit is reached with 4 deluxe units and 6 economy units.
