Question:
The degree of an objective function of a linear programming problem is
The degree of an objective function of a linear programming problem is
Show Hint
Tip 1: The word 'Linear' in Linear Programming itself specifies that the degree of the function and constraints must be 1.
Tip 2: If the degree were higher, it would fall under Non-Linear Programming.
Tip 2: If the degree were higher, it would fall under Non-Linear Programming.
Updated On: Sep 10, 2026
- \( 0 \)
- \( 1 \)
- \( 2 \)
- Any natural number
Show Solution
Verified By Collegedunia
The Correct Option is B
Solution and Explanation
Concept:
• Linear Programming (LP) is a method to achieve the best outcome in a mathematical model whose requirements are represented by linear relationships.
• A linear relationship or function is a polynomial of degree 1.
Step 1: Define the objective function form
In any standard LPP, the objective function \( Z \) is typically written as: \[ Z = ax + by \]
where \( a \) and \( b \) are constants and \( x, y \) are decision variables.
Step 2: Determine the degree of the expression
The degree of a term is the sum of the exponents of the variables in that term.
In \( ax \), the exponent of \( x \) is 1.
In \( by \), the exponent of \( y \) is 1.
Since the highest power of the variables is 1, the degree is 1.
• Linear Programming (LP) is a method to achieve the best outcome in a mathematical model whose requirements are represented by linear relationships.
• A linear relationship or function is a polynomial of degree 1.
Step 1: Define the objective function form
In any standard LPP, the objective function \( Z \) is typically written as: \[ Z = ax + by \]
where \( a \) and \( b \) are constants and \( x, y \) are decision variables.
Step 2: Determine the degree of the expression
The degree of a term is the sum of the exponents of the variables in that term.
In \( ax \), the exponent of \( x \) is 1.
In \( by \), the exponent of \( y \) is 1.
Since the highest power of the variables is 1, the degree is 1.
Was this answer helpful?
0
0
Top CBSE CLASS XII Mathematics Questions
- 2, b, c are in A.P. and the range of determinant $\begin{vmatrix}1&1&1\\ 2&b&c\\ 4&b^{2}&c^{2}\end{vmatrix}$ is [2, 16]. Then find range of c is
- A committee of 11 members is to be formed from 8 males and 5 females. Let m denotes the number of ways of selecting committee having atleast 6 males and n denotes the number of ways of selecting atleast 3 females then
Determine whether each of the following relations are reflexive, symmetric, and transitive.
- Relation R in the set A={1,2,3,...13,14} defined as R={(x,y): 3x-y=0}.
- Relation R in the set of N natural numbers defined as R={(x,y): y=x+5 and x<4}.
- Relation R in the set A={1,2,3,4,5,6} defined as R={(x,y): y is divisible by x}.
- Relation R in the set of Z integers defined as R={(x,y): x-y is an integer}
- Relation R in the set of human beings in a town at a particular time given by
- R={(x,y): x and y work at same place}
- R={(x,y): x and y live in the same locality}
- R={(x,y): x is exactly 7 am taller that y}
- R={(x,y): x is wife of y}
- R={(x,y):x is father of y}
Show that the relation R in the set R of real numbers, defined as
R = {(a, b): a ≤ b2 } is neither reflexive nor symmetric nor transitive.Check whether the relation R defined in the set {1, 2, 3, 4, 5, 6} as
R = {(a, b): b = a + 1} is reflexive, symmetric or transitive.
View More Questions
Top CBSE CLASS XII Linear Programming Questions
- In an LPP, corner points of the feasible region determined by the system of linear constraints are \((1,1), (3,0), (0,3)\). If \(Z = ax + by\), where \(a>0, b>0\) is to be minimized, the condition on \(a\) and \(b\) so that the minimum of \(Z\) occurs at \((3, 0)\) and \((1, 1)\) will be:
- The maximum value of \(Z = 3x + 4y\) subject to the constraints \(x + y \leq 1\), \(x \geq 0\), \(y \geq 0\) is:
Solve the following LPP graphically: Maximize: \[ Z = 2x + 3y \] Subject to: \[ \begin{aligned} x + 4y &\leq 8 \quad \text{(1)} \\ 2x + 3y &\leq 12 \quad \text{(2)} \\ 3x + y &\leq 9 \quad \text{(3)} \\ x &\geq 0,\quad y \geq 0 \quad \text{(non-negativity constraints)} \end{aligned} \]
- The feasible region of a linear programming problem with objective function \( Z = 5x + 7y \) is shown below :
- 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 \)
View More Questions
Top CBSE CLASS XII Questions
- 2, b, c are in A.P. and the range of determinant $\begin{vmatrix}1&1&1\\ 2&b&c\\ 4&b^{2}&c^{2}\end{vmatrix}$ is [2, 16]. Then find range of c is
- A boy of mass 50 kg is standing at one end of a, boat of length 9 m and mass 400 kg. He runs to the other, end. The distance through which the centre of mass of the boat boy system moves is
- A capillary tube of radius r is dipped inside a large vessel of water. The mass of water raised above water level is M. If the radius of capillary is doubled, the mass of water inside capillary will be
- A circular disc is rotating about its own axis. An external opposing torque 0.02 Nm is applied on the disc by which it comes rest in 5 seconds. The initial angular momentum of disc is
- A circular disc is rotating about its own axis at uniform angular velocity \(\omega.\) The disc is subjected to uniform angular retardation by which its angular velocity is decreased to \(\frac {\omega}{2}\) during 120 rotations. The number of rotations further made by it before coming to rest is
View More Questions