The degree of an objective function of a linear programming problem is (A)\(0\) (B)\(1\) (C)\(2\) (D)Any natural number
CBSE Class 12 Maths · Linear Programming
CBSE Class 12 Maths · Linear Programming
Imagine you are trying to earn as much pocket money as possible. The rule says your earning depends on how many chores you do — no squaring, no multiplying chores together, just plain counting. That plain, straight rule is called a linear expression. In a Linear Programming Problem, the goal we want to achieve always follows this plain, straight rule. Because each variable appears only once to the power of 1, the degree — meaning the highest power used — is simply 1.
Answer: The correct option is (B) \( 1 \). The objective function of a linear programming problem is always linear, so its degree is 1.
In a Linear Programming Problem (LPP), we optimize (maximize or minimize) a quantity called the objective function, subject to certain linear constraints. The word 'Linear' is the key idea here. In an LPP, the objective function is always a linear expression in the decision variables. A linear expression means each variable appears only to the first power, with no products of variables (like \( xy \)), no squares (like \( x^2 \)), and no higher powers. The degree of an expression is the highest power of the variables present in it. Since every term in a linear objective function has the variables raised only to power 1, the degree of the objective function is always 1.
General objective function: \[ Z = ax + by \] where \( a \) and \( b \) are constants, and \( x, y \) are decision variables.
The correct option is (B) \( 1 \). The objective function of a linear programming problem is always linear, so its degree is 1.
A common mistake is choosing (D) 'Any natural number', thinking the objective function could be of higher degree. But if the function had degree 2 or more, the problem would no longer be a 'Linear' Programming Problem; the objective function must always be linear, so the degree is fixed at 1.
The correct option is (B) \( 1 \). The objective function of a linear programming problem is always linear, so its degree is 1.
One common mistake: students confuse the degree of the objective function with the number of decision variables. Even if an LPP has two variables \( x \) and \( y \), the degree of the objective function \( Z = ax + by \) is still 1, not 2, because degree refers to the highest power of any single variable, not the count of variables.
Answer: The correct option is (B) \( 1 \). The objective function of a linear programming problem is always linear, so its degree is 1.
Question: Which of the following can be the objective function of a Linear Programming Problem? Choose the correct option and state the degree of the objective function used in LPP. (A) \( Z = 3x^2 + 2y \) (B) \( Z = 5x + 4y \) (C) \( Z = xy + 3 \) (D) \( Z = x^2 y + 7 \)
Solution: In a Linear Programming Problem, the objective function must be a linear function of the decision variables. A linear function contains terms where each decision variable has degree exactly 1, with no products between variables. Let us examine each option: Option (A): \( Z = 3x^2 + 2y \) contains \( x^2 \), which has degree 2. This is NOT linear. Option (B): \( Z = 5x + 4y \) — every term has degree 1. This IS a linear function. Option (C): \( Z = xy + 3 \) — the term \( xy \) has degree 2 (product of two variables). This is NOT linear. Option (D): \( Z = x^2 y + 7 \) — the term \( x^2 y \) has degree 3. This is NOT linear. Therefore, only option (B) qualifies as an objective function for an LPP. The degree of the objective function in a Linear Programming Problem is always \( 1 \).
Answer: Option (B); the degree of the objective function in LPP is \( 1 \).
Question: A student claims that the objective function of a Linear Programming Problem can be \( Z = 7x^2 + 3y^2 - xy \) because it involves only two variables \( x \) and \( y \). Is the student correct? Justify your answer by identifying the degree of the objective function that is actually required in LPP.
Solution: The student's claim is incorrect. Let us analyse the given function and explain why. The proposed objective function is \( Z = 7x^2 + 3y^2 - xy \). Degree of each term: - The term \( 7x^2 \) has degree 2. - The term \( 3y^2 \) has degree 2. - The term \( xy \) has degree 2 (sum of exponents of \( x \) and \( y \) is \( 1 + 1 = 2 \)). Since at least one term has degree greater than 1, the overall degree of the function is \( 2 \), making it a quadratic (non-linear) function. For a problem to be a Linear Programming Problem, every constraint and the objective function must be linear — meaning each variable appears with exponent 1 only and no two variables are multiplied together. A valid objective function would look like \( Z = 7x + 3y \), which has degree \( 1 \). Conclusion: The student is incorrect. The number of variables is irrelevant to linearity. The degree of the objective function in an LPP must be exactly \( 1 \).
Answer: The student is incorrect. The degree of the objective function in an LPP is \( 1 \), not \( 2 \).
Question: In a Linear Programming Problem, what is the degree of each constraint (linear inequality)? (A) 0 (B) 2 (C) 1 (D) It can be any whole number
Answer: The correct option is (C) \( 1 \). Every constraint in a Linear Programming Problem is a linear inequality, so its degree is always 1.