The norris candy company makes two types of gum; happy chew and chewy chew. To make their gum, NCC has a two stage production. Each stick of happy chew requires 4 seconds at stage one and 6 seconds at stage two. Each stick of chewy chew requires 4 seconds at stage one and 2 seconds at stage two. Both stages run for a maximum of 8 hours a day, Also, they make make at least 2500 sticks of each type of gum per day. The profit of each stick of happy chew is $0.05 and the profit on each stick of chewy chew is $0.10. Find the maximum daily profit of the Norris candy company.
TO solve it, I first wrote down my restrictions then I graphed it in order to find my polygon of constraints. I would use the x and y coordinates of each vertex of the polygon of constraints in the calculation 0.05x+0.10y = optimizing function . The max I would get from his calculation would be my answer. However, I think I didn't write down the right restrictions because my answer isn't correct!
TO solve it, I first wrote down my restrictions then I graphed it in order to find my polygon of constraints. I would use the x and y coordinates of each vertex of the polygon of constraints in the calculation 0.05x+0.10y = optimizing function . The max I would get from his calculation would be my answer. However, I think I didn't write down the right restrictions because my answer isn't correct!
Attachments

16.6 KB Views: 2
Last edited: