Class CBSE Class 12 Mathematics Linear Programming Q #1839
KNOWLEDGE BASED
APPLY
1 Marks 2026 AISSCE(Board Exam) MCQ SINGLE
The degree of an objective function of a linear programming problem is
(A) 0
(B) 1
(C) 2
(D) Any natural number
Prev Next
Correct Answer: B

AI Tutor Explanation

Powered by Gemini

Detailed Solution

Step 1: Define the Objective Function

In a Linear Programming Problem (LPP), the objective function is a linear function of the decision variables, typically represented as Z = ax + by, where a and b are constants and x and y are decision variables.

Step 2: Analyze the Degree

The degree of a polynomial is the highest power of the variable(s) present in the expression. In the linear expression Z = ax + by, the variables x and y are raised to the power of 1.

Step 3: Conclusion

Since the function is linear by definition in the context of LPP, the highest power of the variables is 1. Therefore, the degree of the objective function is 1.

Final Answer: 1

AI generated content. Review strictly for academic accuracy.

Pedagogical Audit
Bloom's Analysis: This is an APPLY question because the student must apply the definition of a linear function to identify the degree of the objective function in an LPP.
Knowledge Dimension: CONCEPTUAL
Justification: The question tests the fundamental understanding of the mathematical structure of linear programming models.
Syllabus Audit: In the context of CBSE Class 12, this is classified as KNOWLEDGE. This question assesses the foundational terminology and definitions required for the Linear Programming chapter.
||KEY:B

More from this Chapter

SA
Solve the following linear programming problem graphically: Minimise $Z=x-5y$ subject to the constraints: $x-y\ge0$, $-x+2y\ge2$, $x\ge3$, $y\le4$, $y\ge0$.
SA
Solve the following Linear Programming Problem graphically: Maximise $Z=200x+120y$ subject to the constraints $x+y\le 300$, $3x+y\le 600$, $x-y\ge -100$, $x,y\ge 0$
MCQ_SINGLE
The corner points of the feasible region determined by the system of linear constraints are (0,0), (0, 40), (20, 40), (60, 20) and (60, 0). If the objective function of an LPP is $Z=4x+3y$, then the maximum value is :
MCQ_SINGLE
16. Which of the following points satisfies both the inequations $2x+y\le10$ and $x+2y\ge8$?
MCQ_SINGLE
The common region determined by all the constraints of a linear programming problem is called :
View All Questions