Class CBSE Class 12 Mathematics Linear Programming Q #1735
KNOWLEDGE BASED 1 Marks 2026 AISSCE(Board Exam) MCQ SINGLE
For the feasible region shown below, the non-trivial constraints of the linear programming problem are
(A) $x+y \le 5$, $x+3y \le 9$
(B) $x+y \le 5$, $x+3y \ge 9$
(C) $x+y \ge 5$, $x+3y \le 9$
(D) $x+y \ge 5$, $3x+y \le 9$
Prev Next

More from this Chapter

MCQ_SINGLE
The region represented by the system of inequations $3x+y\ge 3$, $2x-y\ge -5$, $x, y\ge 0$ is:
SA
Solve the following linear programming problem graphically: Maximise $Z=2x+3y$ subject to the constraints: $x+y\le6$, $x\ge2$, $y\le3$, $x,y\ge0$
VSA
In a Linear Programming Problem, the objective function $Z=5x+4y$ needs to be maximised under constraints $3x+y\le6$, $x\le1$, $x, y\ge0$. Express the LPP on the graph and shade the feasible region and mark the corner points.
MCQ_SINGLE
Of the following, which group of constraints represents the feasible region given below ?
SA
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$
View All Questions