Linear Programming
If there is a maximum or a minimum value of the linear objective function, it occurs at one or more vertices of the feasible region.
You can solve a problem using linear programming by testing in the objective function all of the vertices of the feasible region.
Multiple Choice What point in the feasible region maximizes P for the objective function P = 2x + y?
Constraints
What quadrant will the feasible region be in?
The constraints
Step 1
Graph the inequalities.
Step 2
Form the feasible region.
Step 3
Find the coordinates of each vertex.
Step 4
Evaluate P at each vertex.
P has a maximum value of 7 when x = 3 and y = 1. The correct choice is C.