Home › UP Board Class 12 › Mathematics › Linear Programming › Linear programming problems seek to maximise or:
Linear programming problems seek to maximise or:
AMinimise
BRandomise
CNormalise
DStabilise
Answer & Solution
Correct answer: A. Minimise
1. Such problems aim at the best possible outcome.
2. Profit is pushed up while cost is pushed down.
3. So they maximise or minimise a quantity.
4. The answer is minimise.
_Source: NCERT Class 12 Mathematics, Ch 12 'Linear Programming'_
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: