Q1737: The region represented by the system of inequations $3x+y\ge... | Class CBSE Class 12

Class CBSE Class 12 Mathematics Linear Programming Q #1737

KNOWLEDGE BASED 1 Marks 2026 AISSCE(Board Exam) MCQ SINGLE

The region represented by the system of inequations $3x+y\ge 3$, $2x-y\ge -5$, $x, y\ge 0$ is:

(A) unbounded in $1^{st}$ quadrant

(B) bounded in $1^{st}$ quadrant

(C) unbounded in $2^{nd}$ quadrant

(D) bounded in $2^{nd}$ quadrant

Prev Next

More from this Chapter

Solve the following linear programming problem graphically: Maximise $z=500x+300y,$ subject to constraints $x+2y\le12$, $2x+y\le12$, $4x+5y\ge20$, $x\ge0$, $y\ge0$

15. The solution set of the inequation $3x+5y

If the feasible region of a linear programming problem with objective function \(Z = ax + by\), is bounded, then which of the following is correct?

Solve graphically the following linear programming problem : Maximise \(z = 6x + 3y\), subject to the constraints\begin{align} 4x + y &\ge 80 \\ 3x + 2y &\le 150 \\ x + 5y &\ge 115 \\ x, y &\ge 0 \end{align}

The common region determined by all the constraints of a linear programming problem is called :

View All Questions