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
Two depots hold 180 and 250 tons; two customers order 200 and 150 tons. After the cheapestA gardener needs AT LEAST 10 units of chemical A. A jar gives 5 units and a carton 1 unit.A gardener needs at least 10, 12 and 12 units of chemicals A, B and C. Jars cost 3,000 andMine A gives 1, 3 and 5 tons of high, medium and low grade ore daily; mine B gives 2 tons Profit is Shs. 3000 on a ring and Shs. 1900 on a chain. With $x$ rings and $y$ chains, theA firm makes $x$ rings and $y$ chains, at most 24 items a day. A ring takes 1 hour, a chaiSome problems minimise a linear function subject to given:A linear programming problem must have constraints that are: