Home › JEE Main › Mathematics › Linear Programming › Problems that seek to maximise profit or minimis…
Problems that seek to maximise profit or minimise cost are called:
AOptimisation problems
BOptional problems
COperational problems
DOccasional problems
Answer & Solution
Correct answer: A. Optimisation problems
1. A whole family of problems asks for the best value rather than any value.
2. They may seek the largest profit or the smallest cost.
3. Such problems form a general class called optimisation problems.
4. Linear programming is an important special case of them.
_Source: NCERT Class XII Mathematics Part II, 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: