Answer:
x = 3, y = 0
Step-by-step explanation:
In a linear programming problem, optimum point is on a vertex of the feasible region. In figure feasible region is shown in orange. So, the possible optimal points are (0,0), (0,1), (1.5, 1.5) and (3, 0). Evaluating them in objective function gives
Point | Objective function
(0,0) | 0
(0,1) | -4
(1.5, 1.5) | 1.5
(3, 0) | 15
Then, the maximum is x = 3, y = 0
