gaokao 2018 Q14

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