You can put this solution on YOUR website! You can find the feasible region that the constraints apply to by graphing.
Plot the two lines and and determine which region is appropriate and remember the other two constraints and .
The graph shows the blue region bounded by the four corners.
From linear programming, the max and min values of your function occur on the corners.
Let's calculate the values at each corner.
The corners are (0,0), (1,0), (0,2), and (2,1).
z=3x +2y=3(0)+2(0)=0
z=3x +2y=3(1)+2(0)=3
z=3x +2y=3(0)+2(2)=4
z=3x +2y=3(2)+2(1)=8
The max value is 8 and it occurs at (2,1).