SOLUTION: A company makes two kinds of cookies. Each batch of chocolate cookies requires 6 trucks to ship, takes 9 hrs to bake, and earns the company $600. Each batch of cream filled require

Algebra ->  Rate-of-work-word-problems -> SOLUTION: A company makes two kinds of cookies. Each batch of chocolate cookies requires 6 trucks to ship, takes 9 hrs to bake, and earns the company $600. Each batch of cream filled require      Log On


   



Question 89848: A company makes two kinds of cookies. Each batch of chocolate cookies requires 6 trucks to ship, takes 9 hrs to bake, and earns the company $600. Each batch of cream filled requires 4 trucks to ship, 12 hours to bake, and earns the company$500. graph the region and determine how many of each should be made to maximize profit. it has a total of 48 trucks and 72 hours of baking time.

as far as ive gotten: 6x+4y<48
9x+12<72

Answer by stanbon(75887) About Me  (Show Source):
You can put this solution on YOUR website!
A company makes two kinds of cookies. Each batch of chocolate cookies requires 6 trucks to ship, takes 9 hrs to bake, and earns the company $600. Each batch of cream filled requires 4 trucks to ship, 12 hours to bake, and earns the company$500. There are a total of 48 trucks and 72 hours of baking time.
graph the region and determine how many of each should be made to maximize profit.
--------------
Let number of chocolate batches be "x"; Let number of cream batches be "y".
# of choc batches: 0<=x<=48
# of cream batches:0<=y<=48
Truck : 6x+4y <=48
Bake : 9x+12y<=72
Objective function: Profit = 600x+500y
--------------------
Solve Truck and Bake for y:
Truck: y <= (-3/2)x+12; graph it
Bake: y<=(-3/4)x+6 ; graph it
Draw vertical lines at x=0 and x=48
Draw horizontal lines at y=0 and y=48
-------------
Find the vertices of the resulting closed figure.
Use the coordinates of those vertices to find the maximum possible profit.
==============
graph%28400%2C300%2C-10%2C25%2C-10%2C25%2C%28-3%2F2%29x%2B12%2C%28-3%2F4%29x%2B6%29
----------------------
Cheers,
Stan H.