Explore BrainMass

# Linear Programming - Graphical Maximization

This content was COPIED from BrainMass.com - View the original, and get the already-completed solution here!

I am studying for a test and I had this homework problem that is confusing me. Can you show the feasible region and corner points, evaluate the objective function at each corner point. determine the values of x, y, and Z at the optimal solution

Max Z = 3x + 4y

S. T.
x + 3y <24
3x +y>15
3x-2y<0
x,y>0

#### Solution Preview

evaluate the objective function at each corner point. determine the values of x, y, and Z at the optimal solution
Maximize
S. T.

The final constraint tells us the values are only positive, so we are only interested in the first quadrant. Consider each constraint as a line, we evaluate at a test point (generally the origin (0,0) is easy and good and decide which side of the line our feasible region is in. So, we need to graph these three lines: ...

#### Solution Summary

A detailed solution is attached in a Word document showing mapping out the feasible region and analysis of the corner points

\$2.19