Class CBSE Class 12 Mathematics Linear Programming Q #676
KNOWLEDGE BASED
UNDERSTAND
1 Marks 2024 AISSCE(Board Exam) MCQ SINGLE
The common region determined by all the constraints of a linear programming problem is called :
(A) an unbounded region
(B) an optimal region
(C) a bounded region
(D) a feasible region
Prev Next
Correct Answer: D

AI Tutor Explanation

Powered by Gemini

Step-by-Step Solution

The common region determined by all the constraints of a linear programming problem is called the feasible region. This region represents all possible solutions that satisfy all the constraints of the problem.

Correct Answer: a feasible region

AI Suggestion: Option D

AI generated content. Review strictly for academic accuracy.

Pedagogical Audit
Bloom's Analysis: This is an UNDERSTAND question because it requires the student to recall the definition of the feasible region in linear programming.
Knowledge Dimension: FACTUAL
Justification: The question directly tests the student's knowledge of a specific term ("feasible region") used in linear programming. It is a definition-based recall.
Syllabus Audit: In the context of CBSE Class 12, this is classified as KNOWLEDGE. The question is directly based on definitions and concepts explained in the textbook.

More from this Chapter

MCQ_SINGLE
The number of feasible solutions of the linear programming problem given as Maximize $z=15x+30y$ subject to constraints : $3x+y\le12, x+2y\le10, x\ge0, y\ge0$ is
MCQ_SINGLE
15. The solution set of the inequation $3x+5y
MCQ_SINGLE
The restrictions imposed on decision variables involved in an objective function of a linear programming problem are called :
MCQ_SINGLE
The number of corner points of the feasible region determined by the constraints x-y\ge0, 2y\le x+2, x\ge0, y\ge0 is:
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 :
View All Questions