Solution

This is the cost matrix.

25	5	13	23	79	58
82	79	3	76	43	29
66	92	45	17	11	56
69	75	79	29	65	28
18	26	6	38	48	63
7	20	24	41	42	69

Subtract row minima

For each row, the minimum element is subtracted from all elements in that row.

20	0	8	18	74	53	(-5)
79	76	0	73	40	26	(-3)
55	81	34	6	0	45	(-11)
41	47	51	1	37	0	(-28)
12	20	0	32	42	57	(-6)
0	13	17	34	35	62	(-7)

Subtract column minima

For each column, the minimum element is subtracted from all elements in that column.

20	0	8	17	74	53
79	76	0	72	40	26
55	81	34	5	0	45
41	47	51	0	37	0
12	20	0	31	42	57
0	13	17	33	35	62
			(-1)

Cover all zeros with a minimum number of lines

A total of 5 lines are required to cover all zeros.

20	0	8	17	74	53	x
79	76	0	72	40	26
55	81	34	5	0	45	x
41	47	51	0	37	0	x
12	20	0	31	42	57
0	13	17	33	35	62	x
		x

Create additional zeros

The number of lines is smaller than 6. The smallest uncovered element is 12. We subtract this value from all uncovered elements and add it to all elements covered twice.

20	0	20	17	74	53
67	64	0	60	28	14
55	81	46	5	0	45
41	47	63	0	37	0
0	8	0	19	30	45
0	13	29	33	35	62

Cover all zeros with a minimum number of lines

A total of 5 lines are required to cover all zeros.

20	0	20	17	74	53	x
67	64	0	60	28	14
55	81	46	5	0	45	x
41	47	63	0	37	0	x
0	8	0	19	30	45
0	13	29	33	35	62
x		x

Create additional zeros

The number of lines is smaller than 6. The smallest uncovered element is 8. We subtract this value from all uncovered elements and add it to all elements covered twice.

28	0	28	17	74	53
67	56	0	52	20	6
63	81	54	5	0	45
49	47	71	0	37	0
0	0	0	11	22	37
0	5	29	25	27	54

Cover all zeros with a minimum number of lines

A total of 5 lines are required to cover all zeros.

28	0	28	17	74	53
67	56	0	52	20	6
63	81	54	5	0	45	x
49	47	71	0	37	0	x
0	0	0	11	22	37
0	5	29	25	27	54
x	x	x

Create additional zeros

The number of lines is smaller than 6. The smallest uncovered element is 6. We subtract this value from all uncovered elements and add it to all elements covered twice.

28	0	28	11	68	47
67	56	0	46	14	0
69	87	60	5	0	45
55	53	77	0	37	0
0	0	0	5	16	31
0	5	29	19	21	48

Cover all zeros with a minimum number of lines

A total of 6 lines are required to cover all zeros.

28	0	28	11	68	47	x
67	56	0	46	14	0	x
69	87	60	5	0	45	x
55	53	77	0	37	0	x
0	0	0	5	16	31	x
0	5	29	19	21	48	x

The optimal assignment

Because there are 6 lines required, an optimal assignment exists among the zeros.

28	0	28	11	68	47
67	56	0	46	14	0
69	87	60	5	0	45
55	53	77	0	37	0
0	0	0	5	16	31
0	5	29	19	21	48

This corresponds to the following optimal assignment in the original cost matrix.

25	5	13	23	79	58
82	79	3	76	43	29
66	92	45	17	11	56
69	75	79	29	65	28
18	26	6	38	48	63
7	20	24	41	42	69

The total minimum cost is 87.

25	5	13	23	79	58
82	79	3	76	43	29
66	92	45	17	11	56
69	75	79	29	65	28
18	26	6	38	48	63
7	20	24	41	42	69

20	0	8	17	74	53	x
79	76	0	72	40	26
55	81	34	5	0	45	x
41	47	51	0	37	0	x
12	20	0	31	42	57
0	13	17	33	35	62	x
		x

20	0	20	17	74	53
67	64	0	60	28	14
55	81	46	5	0	45
41	47	63	0	37	0
0	8	0	19	30	45
0	13	29	33	35	62

20	0	20	17	74	53	x
67	64	0	60	28	14
55	81	46	5	0	45	x
41	47	63	0	37	0	x
0	8	0	19	30	45
0	13	29	33	35	62
x		x

28	0	28	17	74	53
67	56	0	52	20	6
63	81	54	5	0	45
49	47	71	0	37	0
0	0	0	11	22	37
0	5	29	25	27	54

28	0	28	17	74	53
67	56	0	52	20	6
63	81	54	5	0	45	x
49	47	71	0	37	0	x
0	0	0	11	22	37
0	5	29	25	27	54
x	x	x

28	0	28	11	68	47	x
67	56	0	46	14	0	x
69	87	60	5	0	45	x
55	53	77	0	37	0	x
0	0	0	5	16	31	x
0	5	29	19	21	48	x

25	5	13	23	79	58
82	79	3	76	43	29
66	92	45	17	11	56
69	75	79	29	65	28
18	26	6	38	48	63
7	20	24	41	42	69

25	5	13	23	79	58
82	79	3	76	43	29
66	92	45	17	11	56
69	75	79	29	65	28
18	26	6	38	48	63
7	20	24	41	42	69

20	0	8	17	74	53	x
79	76	0	72	40	26
55	81	34	5	0	45	x
41	47	51	0	37	0	x
12	20	0	31	42	57
0	13	17	33	35	62	x
		x

20	0	20	17	74	53
67	64	0	60	28	14
55	81	46	5	0	45
41	47	63	0	37	0
0	8	0	19	30	45
0	13	29	33	35	62

20	0	20	17	74	53	x
67	64	0	60	28	14
55	81	46	5	0	45	x
41	47	63	0	37	0	x
0	8	0	19	30	45
0	13	29	33	35	62
x		x

28	0	28	17	74	53
67	56	0	52	20	6
63	81	54	5	0	45
49	47	71	0	37	0
0	0	0	11	22	37
0	5	29	25	27	54

28	0	28	17	74	53
67	56	0	52	20	6
63	81	54	5	0	45	x
49	47	71	0	37	0	x
0	0	0	11	22	37
0	5	29	25	27	54
x	x	x

28	0	28	11	68	47	x
67	56	0	46	14	0	x
69	87	60	5	0	45	x
55	53	77	0	37	0	x
0	0	0	5	16	31	x
0	5	29	19	21	48	x

25	5	13	23	79	58
82	79	3	76	43	29
66	92	45	17	11	56
69	75	79	29	65	28
18	26	6	38	48	63
7	20	24	41	42	69

Solve an assignment problem online

Solution

Subtract row minima

Subtract column minima

Cover all zeros with a minimum number of lines

Create additional zeros

Cover all zeros with a minimum number of lines

Create additional zeros

Cover all zeros with a minimum number of lines

Create additional zeros

Cover all zeros with a minimum number of lines

The optimal assignment

25	5	13	23	79	58
82	79	3	76	43	29
66	92	45	17	11	56
69	75	79	29	65	28
18	26	6	38	48	63
7	20	24	41	42	69

20	0	8	17	74	53	x
79	76	0	72	40	26
55	81	34	5	0	45	x
41	47	51	0	37	0	x
12	20	0	31	42	57
0	13	17	33	35	62	x
		x

20	0	20	17	74	53
67	64	0	60	28	14
55	81	46	5	0	45
41	47	63	0	37	0
0	8	0	19	30	45
0	13	29	33	35	62

20	0	20	17	74	53	x
67	64	0	60	28	14
55	81	46	5	0	45	x
41	47	63	0	37	0	x
0	8	0	19	30	45
0	13	29	33	35	62
x		x

28	0	28	17	74	53
67	56	0	52	20	6
63	81	54	5	0	45
49	47	71	0	37	0
0	0	0	11	22	37
0	5	29	25	27	54

28	0	28	17	74	53
67	56	0	52	20	6
63	81	54	5	0	45	x
49	47	71	0	37	0	x
0	0	0	11	22	37
0	5	29	25	27	54
x	x	x

28	0	28	11	68	47	x
67	56	0	46	14	0	x
69	87	60	5	0	45	x
55	53	77	0	37	0	x
0	0	0	5	16	31	x
0	5	29	19	21	48	x

25	5	13	23	79	58
82	79	3	76	43	29
66	92	45	17	11	56
69	75	79	29	65	28
18	26	6	38	48	63
7	20	24	41	42	69