Home › Maharashtra HSC Class 12 (Commerce) › 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
If a feasible region of an LPP is empty, the problem isHungarian method for assignment problem requires the cost matrix to beMaximise 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 functThe non-negativity constraints in an LPP typically include: