gaokao 2017 Q7

gaokao · China · national-I-arts 5 marks Inequalities Linear Programming (Optimize Objective over Linear Constraints)
Let $x, y$ satisfy the constraint conditions $\left\{ \begin{array}{l} x - y \geq 1 \\ y \geq 0 \end{array} \right.$. Then the maximum value of $z = x + y$ is
A. 0
B. 1
C. 2
D. 3
Let $x, y$ satisfy the constraint conditions $\left\{ \begin{array}{l} x - y \geq 1 \\ y \geq 0 \end{array} \right.$. Then the maximum value of $z = x + y$ is

A. 0

B. 1

C. 2

D. 3