Answer:
Solution:
Let x = number of cupcakes and y = number of cookies
The objective is to maximize revenue, which is given by the equation:
Revenue = 2x + 1.5y
The constraints are:
0.5x + 0.3y ≤ 150 (budget)
x + y ≤ 300 (maximum number of baked goods)
x ≥ 0, y ≥ 0 (non-negativity)
Using the simplex method, the optimal solution is x = 200 and y = 100. This means that 200 cupcakes and 100 cookies should be baked in order to maximize the revenue given the constraints.