Answer:For all the corner points, the maximum is at point (1, 3)
From the graph of the constraints, the corner points of the feasibility region are (0, 0), (0, 10/3), (1, 3), (2, 0)
For (0, 0): p = 0 + 2(0) = 0
For (0, 10/3): p = 0 + 2(10/3) = 20/3 = 6.67
For (1, 3): p = 1 + 2(3) = 1 + 6 = 7
For (2, 0): p = 2 + 2(0) = 2
Therefore, solution = (1, 3)
