Alan G. answered • 03/24/16

Tutor

5
(4)
Successful at helping students improve in math!

I got different intersection points for the lines: (1,4), (3,2), and (1,2).

According to the principles of linear programming, the objective function is maximized at one of the vertices of the feasible region. In this case, the feasible region is a triangle with the three vertices listed in the last paragraph.

What you need to to is plug these vertices into the objective function, compare the values, and find the largest one. THAT will be the maximum value for the objective function subject to these constraints.

I will let you do the work and find the answer yourself.

These comments should also give you enough help to answer the second question you posted as well.