gaokao 2019 Q11

gaokao · China · national-III-arts Inequalities Linear Programming (Optimize Objective over Linear Constraints)
11. Let the plane region represented by the system of inequalities $\left\{ \begin{array} { l } x + y \geq 6 , \\ 2 x - y \geq 0 \end{array} \right.$ be $D$ . Proposition $p : \exists ( x , y ) \in D , 2 x + y \geq 9$ ; Proposition $q : \forall ( x , y ) \in D , 2 x + y \leq 12$ . Four propositions are given below:
(1) $p \vee q$
(2) $\neg p \vee q$
(3) $p \wedge \neg q$
(4) $\neg p \wedge \neg q$
The numbers of all true propositions among these four are
A. (1)(3)
B. (1)(2)
C. (2)(3)
D. (3)(4)
C
11. Let the plane region represented by the system of inequalities $\left\{ \begin{array} { l } x + y \geq 6 , \\ 2 x - y \geq 0 \end{array} \right.$ be $D$ . Proposition $p : \exists ( x , y ) \in D , 2 x + y \geq 9$ ; Proposition $q : \forall ( x , y ) \in D , 2 x + y \leq 12$ . Four propositions are given below:\\
(1) $p \vee q$\\
(2) $\neg p \vee q$\\
(3) $p \wedge \neg q$\\
(4) $\neg p \wedge \neg q$

The numbers of all true propositions among these four are\\
A. (1)(3)\\
B. (1)(2)\\
C. (2)(3)\\
D. (3)(4)