linear programming app
posted by ash on .
solve this linear programming problem;
A chain saw requires 4 hours of assembly and a wood chipper 6 hours. A maximum of 48 hours of assembly time is available. The profit is $150 on a chain saw and $220 on a chipper. How many of each should be assembled for maximum profit??
Thanks in advance guys!! =]

Let C=chipper, S=chain saw
Objective function:
P(S,C)=150S + 220C
Constraints:
C≥0
S≥0
4S+6C≤48
There are three straight lines, so check the three intersections for the maximum values of the profit=P(S,C).
I see assembling chainsaws a little more profitable than chippers.
By the way, lady math tutors devote their time here too! 
(12,8)