Home › UP Board Class 12 › mathematics › Linear Programming › The non-negativity constraints in an LPP typical…
The non-negativity constraints in an LPP typically include:
A$x \geq 0$ and $y \geq 0$, since real quantities cannot be negative
B$x \geq 1$ and $y \geq 1$, requiring at least one of each on the chart
C$x \leq 0$ and $y \leq 0$, the negative case for the school chart
DNo constraint, since the chart variables can take any value here
Answer & Solution
Correct answer: A. $x \geq 0$ and $y \geq 0$, since real quantities cannot be negative
Non-negativity: $x \geq 0, y \geq 0$ for real quantities (kg, hours, etc.).
Related questions
If a feasible region of an LPP is empty, the problem isHungarian method for assignment problem requires the cost matrix to beAssignment problem is a special case ofMaximise Z = 3x + 2y subject to x + y ≤ 4, x ≥ 0, y ≥ 0. Maximum value of Z isIn LPP, optimal solution (if it exists) is found atThe feasible region of an LPP isIn a linear programming problem (LPP), the objective function isA linear program has an unbounded feasible region. The maximisation of the objective funct