gaokao 2020 Q13

gaokao · China · national-III-arts 5 marks Inequalities Linear Programming (Optimize Objective over Linear Constraints)
If $x , y$ satisfy the constraints $\left\{ \begin{array} { l } x + y \geqslant 0 , \\ 2 x - y \geqslant 0 , \\ x \leqslant 1 , \end{array} \right.$ then the maximum value of $z = 3 x + 2 y$ is $\_\_\_\_$ .
If $x , y$ satisfy the constraints $\left\{ \begin{array} { l } x + y \geqslant 0 , \\ 2 x - y \geqslant 0 , \\ x \leqslant 1 , \end{array} \right.$ then the maximum value of $z = 3 x + 2 y$ is $\_\_\_\_$ .