Final answer:
To solve the linear programming problem, graph the feasible region and evaluate the objective function at each corner point.
Step-by-step explanation:
To solve the given linear programming problem, we need to graph the feasible region determined by the system of inequalities. Then, we can evaluate the objective function at each corner point of the feasible region to find the maximum value.
First, graph the lines x + 3y = 6, -x + y ≤ 4, and 2xy ≤ 8. The feasible region is the intersection of the shaded areas. The corner points of the feasible region are (0, 2), (2, 2), and (4, 0).
Next, evaluate the objective function p = 6x + 4y at each corner point and determine the maximum value. p(0, 2) = 12, p(2, 2) = 20, and p(4, 0) = 24. Therefore, the maximum value of p is 24, which occurs at (4, 0).