9514 1404 393
Answer:
see attached
Explanation:
Short answer: to solve this problem, follow directions.
a. Write the inequalities
Let c and p represent numbers of cakes and pies produced daily. Then the constraints are ...
2c +3p ≤ 108 . . . . . . . . available hours of preparation time
1c +0.5p ≤ 20 . . . . . . . available hours of decoration time
p ≥ 0, c ≥ 0 . . . . . . . . . negative numbers of cakes or pies cannot be produced
__
b. Sketch the feasible region
It works well to let a graphing calculator do this.
The feasible region is the doubly-shaded area with vertices ...
(0, 0), (0, 36), (3, 34), (20, 0)
__
c. Write the profit function
Profit is $25 per cake and $12 per pie, so is ...
p = 25c +12p
__
d. Determine maximum profit
The attached table shows the profit for the various mixes of cakes and pies in the feasible region. The most profit is had by production of cakes only.
The maximum profit is $500 per day for production of 20 cakes.
_____
Additional comment
We have used x for cakes and y for pies in the attachment, because those are variables that the Desmos calculator prefers.
As is sometimes the case, the production point giving maximum profit leaves one of the resources (preparation time) only partially utilized.