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

Four new machines M1, M2, M3 and M4 are to be installed in a machine shop. There are five vacant places A, B, C, D and E available. Because of limited space, machine M2 cannot be placed at C and M3 cannot be placed at A. The cost matrix is given belo…

Q.5 (B) (iii) Four new machines M1, M2, M3 and M4 are to be installed in a machine shop. There are five vacant places A, B, C, D and E available. Because of limited space, machine M2 cannot be placed at C and M3 cannot be placed at A. The cost matrix is given below:

Machines \ PlacesABCDE
M1461056
M274–54
M3–6962
M493723

Find the optimal assignment schedule.

1 answer

Best answer

Answer: M1 → A, M2 → B, M3 → E, M4 → D (place C left vacant); minimum cost = 12

The problem is unbalanced (4 machines, 5 places), so add a dummy machine M5 with zero costs. The prohibited placements (M2 at C, M3 at A) are given a very large cost M.

ABCDE
M1461056
M274M54
M3M6962
M493723
M5 (dummy)00000

Row minimum subtraction (row minima 4, 4, 2, 2, 0). Every column then already has a zero, so column subtraction leaves the matrix unchanged. Making assignments (assigned zeros shown in brackets):

ABCDE
M1[0]2612
M23[0]M10
M3M474[0]
M4715[0]1
M5 (dummy)00[0]00

M1 has a single zero at A: assign M1 → A. M3 has a single zero at E: assign M3 → E (cross the zero of M2 at E). M4 has a single zero at D: assign M4 → D. M2 then has only B: assign M2 → B. The dummy M5 takes C.

Number of assignments = 5 = order of the matrix, so the solution is optimal.

MachinePlaceCost
M1A4
M2B4
M3E2
M4D2
(dummy)C (vacant)0
Total12
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.