Class CBSE Class 12 Mathematics Linear Programming Q #675
KNOWLEDGE BASED
REMEMBER
1 Marks 2024 AISSCE(Board Exam) MCQ SINGLE
The restrictions imposed on decision variables involved in an objective function of a linear programming problem are called :
(A) feasible solutions
(B) constraints
(C) optimal solutions
(D) infeasible solutions
Prev Next
Correct Answer: B

AI Tutor Explanation

Powered by Gemini

Step-by-Step Solution

The question asks for the term used to describe the restrictions on decision variables in a linear programming problem.

Correct Answer: constraints

AI Suggestion: Option B

AI generated content. Review strictly for academic accuracy.

Pedagogical Audit
Bloom's Analysis: This is an REMEMBER question because it requires recalling a definition directly from the textbook.
Knowledge Dimension: FACTUAL
Justification: The question directly tests the recall of the definition of "constraints" in the context of linear programming. This is a basic element and terminology.
Syllabus Audit: In the context of CBSE Class 12, this is classified as KNOWLEDGE. The question assesses the student's understanding of fundamental definitions related to linear programming, a core topic in the syllabus.

More from this Chapter

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 of a Linear Programming Problem are (0, 2), (3, 0), (6, 0), (6, 8) and (0, 5). If \(Z=ax+by;\) (a, \(b>0)\) be the objective function, and maximum value of Z is obtained at (0, 2) and (3, 0), then the relation between a and b is:
MCQ_SINGLE
In a Linear Programming Problem (LPP), the objective function \(Z=2x+5y\) is to be maximised under the following constraints: \(x+y\le4\), \(3x+3y\ge18\), \(x, y\ge0\). Study the graph and select the correct option. The solution of the given LPP: [Image Missing]
MCQ_SINGLE
Of the following, which group of constraints represents the feasible region given below ?
SA
30. Solve the following linear programming problem graphically: Minimise: $z=-3x+4y$ subject to the constraints $x+2y\le8, 3x+2y\le12, x,y\ge0$
View All Questions