Minimize g = 12x + 8y subject to
x + 2y ≥ 10
2x + y ≥ 11
x + y ≥ 9
x ≥ 0, y ≥ 0
Find the indicated maximum or minimum value of the objective function in the linear programming problem. The feasible regions for these problems are found in the answers to Problems 19, 20, 23, and 24 in the 4.1 Exercises.