Home › Maharashtra HSC (Class 12) › businessmathematics › Linear Programming › Assignment problem is a special case of
Assignment problem is a special case of
AGeometric programming (typical) (typical) (typical)
BPure quadratic programming (typical) (typical) (typical)
CNonlinear programming (typical) (typical) (typical)
DTransportation problem with equal supply and demand of one each
Answer & Solution
Correct answer: D. Transportation problem with equal supply and demand of one each
1. Assignment Problem: assign n jobs to n workers minimising total cost (or maximising profit).
2. It is a special case of transportation where each source has supply 1 and each destination has demand 1.
3. Hungarian Method efficiently solves it.
4. Hence (A) is correct.
_Source: Maharashtra Balbharati Std XII Mathematics & Statistics (Commerce), Ch 6 "Linear Programming", §6.5 ¶§6.5_
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: