Home › Maharashtra HSC Class 12 (Commerce) › businessmathematics › Linear Programming › Hungarian method for assignment problem requires…
Hungarian method for assignment problem requires the cost matrix to be
ASquare (equal rows and columns)
BRectangular only (typical)
CSingular (typical) (typical)
DSymmetric (typical) (typical)
Answer & Solution
Correct answer: A. Square (equal rows and columns)
1. The Hungarian Method assumes equal number of jobs and workers, i.e. a square cost matrix.
2. If the original matrix is not square, dummy rows/columns with zero cost are added to make it square.
3. Symmetry is not required.
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 isAssignment problem is a special case ofMaximise 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: