Posted by ash on Wednesday, April 6, 2011 at 12:51pm.
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!
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. ...
linear programming app - write the constraints as linear inequalities and ...
Algebra 2 (Linear Programming) - A bicycle builder makes two models. The basic ...
linear programming - The Pyrotec Company produces three electrical products-...
linear programming - Mountain Laurel Vineyards produces three kinds of wine ...
linear programming - A manufacturer produces two items, bookcases and library ...
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 ...
linear programming - A manufacturer has a maximum of 240, 360, and 180 ...
For Further Reading