3.9 Linear Programming d2
3.9 Linear Programming d2
Objective Function:
Write two inequalities. Then, find the intersection of these inequalities to show all combinations of cakes and pies that Susan can make with
the two constrains given.
Let x = ________________________________________
y = ________________________________________
Suppose each cake makes a profit of $3.50 and each pie makes a profit of $4. How many cakes and pies should Susan make in order to maximize her
profit?
Solution: ____________________________________________________________________________________________________________
DOUGH: One box of plain cookies requires 1.2 pounds of cookie dough.
One box of iced cookies requires 0.9 pounds of cookie dough.
Jack and Jill have 72 pounds of cookie dough.
TIME: One box of plain cookies requires about 0.1 hour to prepare.
One box of iced cookies requires about 0.15 hour to prepare.
Jack and Jill together have 9 hours for preparation.
Write three inequalities. Then, find the intersection of these inequalities to show all combinations of cookies that Jack and Jill can make with the
constraints given.
Let x = ________________________________________
y = ________________________________________
Suppose the profit on each box of plain cookies is $2.00 and the profit on each box of iced cookies is $3.00. How many boxes of each kind of cookie
should jack and Jill make to maximize profit?
Solution: _______________________________________________________________________________________________________________