Hi Kelley,

Suppose you produce $d$ downhill skis and $c$ cross-country skis. Since the profit on each downhill ski is $\$70$ and the profit on each cross-country ski is $\$50$ the total profit is

\[P = 70 d + 50 c \mbox{ dollars.}\]

This is the objective function you are to maximize and notice that it is a linear function of $d$ and $c.$

There are some constraints in your manufacturing process. First of all $c$ and $d$ can't be negative so

\[c \ge 0 \mbox{ and } d \ge 0.\]

You are also constrained by the time available. It takes $2$ hours to manufacture a downhill ski and $1$ hour to produce a cross-country ski. You only have $40$ hours available so

\[2 d + 1 c \le 40.\]

There is a similar constraint inequality that comes from the finishing time. What is it?

Since the objective function and the four constraint inequalities are linear this is a linear programming problem.

Plot the region in the plane described by the four constraint inequalities. The theory of linear programming tells you that the maximum value of the objective function occurs at one of the vertices of the region described by the constraint inequalities. Evaluate the objective function at each of the vertices and decide which gives you the maximum profit.

Now repeat the problem with the time available for manufacturing increased to 48 hours.

Penny