If necessary, review Theorem 1. In Problem the feasible region is the set of points on and inside the rectangle with vertices (0, 0), (12, 0), (0, 5), and (12, 5). Find the maximum and minimum values of the objective function Q over the feasible region.

Q = 3x + 15y

Data from Theorem 1

Transcribed Image Text:

THEOREM 1 Fundamental Theorem of Linear Programming If the optimal value of the objective function in a linear programming problem exists, then that value must occur at one or more of the corner points of the feasible region.