The assignment problem is some of the significant combinatorial optimization difficulties in the division of operations research in mathematics. It contains of looking for a supreme weight matching in a weighted bipartite graph. The assignment problem constraint means that agent 3 can be assigned to no more than two tasks.