Five different machines can do any of the five required jobs, with different profits resulting from each assignment as shown in the table. Find out maximum profit possible through optimal assignments. 30
|
Machine
Job
|
M1
|
M2
|
M3
|
M4
|
M5
|
|
J1
|
30
|
37
|
40
|
28
|
40
|
|
J2
|
40
|
24
|
27
|
21
|
36
|
|
J3
|
40
|
32
|
33
|
30
|
35
|
|
J4
|
25
|
38
|
40
|
36
|
36
|
|
J5
|
29
|
62
|
41
|
34
|
39
|