Class CBSE Class 12 Mathematics Linear Programming Q #1737
KNOWLEDGE BASED
REMEMBER
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
Correct Answer: B
Pedagogical Audit
Bloom's Analysis: This is an APPLY question because the student must apply the graphical method of linear programming to determine the geometric properties of a feasible region.
Knowledge Dimension: PROCEDURAL
Justification: The student follows a sequence of steps: plotting lines, identifying half-planes, and checking for boundedness within the first quadrant.
Syllabus Audit: In the context of CBSE Class 12, this is classified as COMPETENCY. It tests the conceptual understanding of Linear Programming Problems (LPP) beyond mere calculation, focusing on the nature of the feasible region.

More from this Chapter

MCQ_SINGLE
Of the following, which group of constraints represents the feasible region given below ?
SA
Solve the following linear programming problem graphically : Minimize $Z = 13x - 15y$ Subject to constraints $$x + y \leq 7,$$ $$2x - 3y + 6 \geq 0,$$ $$x \geq 0, y \geq 0$$
SA
Determine graphically the minimum value of the following objective function : $z=500x+400y$ subject to constraints $x+y\le200, x\ge20, y\ge4x, y\ge0$
MCQ_SINGLE
The corner points of the feasible region in the graphical representation of a linear programming problem are (2, 72), (15, 20) and (40, 15). If z=18x+9y be the objective function, then :
MCQ_SINGLE
A linear programming problem deals with the optimization of a/an:
View All Questions