Restricted Assignment Problem | Hungarian Method | Simple Algorithm

A restricted assignment problem is the one in which one or more allocations are prohibited or not possible. For such allocations we assign “M”, which is infinitely high cost. No allocation is given in M. An unbalanced problem is one in which number of rows is not equal to number of columns.