Posted by **ash** on Wednesday, April 6, 2011 at 12:51pm.

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!! =]

- linear programming app -
**MathMate**, Wednesday, April 6, 2011 at 1:25pm
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 chain-saws a little more profitable than chippers.

By the way, lady math tutors devote their time here too!

## Answer this Question

## Related Questions

- math - solve this linear programming problem; A chain saw requires 4 hours of ...
- calculus - A chain saw requires 2 hours of assembly and a wood chipper 5 hours. ...
- Algebra 2 (Linear Programming) - A bicycle builder makes two models. The basic ...
- linear programming app - write the constraints as linear inequalities and ...
- math - A company produces three types of color TVs: Models X, Y and Z. Each ...
- math - A company produces three types of color TVs: Models X, Y and Z. Each ...
- Algebra 2 - A bicycle builder makes two models. The basic model requires 2 hours...
- Math - Linear Inequalities - The Wellbuilt Company produces two types of wood ...
- linear programming - Mountain Laurel Vineyards produces three kinds of wine ...
- Algebra - If some one can get me started, I should be able to graph this. ...