Skip to content
doubtly
Chapter: Assignment Problem and Sequencing· Mathematics & Statistics (Commerce) Part 2

Three new machines \(M_1, M_2, M_3\) are to be installed in a machine shop. There are four vacant places A, B, C, D. Due to limited space, machine \(M_2\) can not be placed at B. The cost matrix (in hundred ₹) is as follows :Machine / PlacesABCD\(M_1…

Q.6 (A)(ii) Three new machines \(M_1, M_2, M_3\) are to be installed in a machine shop. There are four vacant places A, B, C, D. Due to limited space, machine \(M_2\) can not be placed at B. The cost matrix (in hundred ₹) is as follows :

Machine / PlacesABCD
\(M_1\)13101211
\(M_2\)15–1320
\(M_3\)57106

Determine the optimum assignment schedule and find the minimum cost.

1 answer

Best answer

Answer: \(M_1 \to B\), \(M_2 \to C\), \(M_3 \to A\) (place D left vacant); minimum cost = 28 hundred ₹ = ₹ 2,800.

The problem is unbalanced (3 machines, 4 places), so add a dummy machine \(M_4\) with zero costs. The prohibited cell \(M_2\)–B is given a very large cost M.

ABCD
\(M_1\)13101211
\(M_2\)15M1320
\(M_3\)57106
\(M_4\) (dummy)0000

Row reduction (subtract 10, 13, 5, 0 from the rows):

ABCD
\(M_1\)3021
\(M_2\)2M07
\(M_3\)0251
\(M_4\)0000

Column reduction changes nothing, since every column already has a zero (the dummy row). Minimum number of lines covering all zeros = 4 = order of the matrix, so an optimal assignment exists.

Row \(M_1\) has a single zero at B, row \(M_2\) a single zero at C and row \(M_3\) a single zero at A; the dummy \(M_4\) takes D.

MachinePlaceCost (hundred ₹)
\(M_1\)B10
\(M_2\)C13
\(M_3\)A5
\(M_4\) (dummy)D0
Total28

Minimum cost = 28 hundred rupees = ₹ 2,800. Place D remains vacant.

Doubtly AI · 29 Oct 2026 AI-verified · Nov 2026 Report
Was this answer helpful?

Your answer

Log in or create a free account to answer this question.