The assignment problem is a type of linear programming, where it focuses on solving for the best and optimal solution for assigning a certain number of tasks and resources, and with the goal of minimizing the total cost or maximizing profit. And the number of tasks should be equal to the number of assigned individuals or resources.
Click on video to learn more!
(1925-2014)
This method was commonly used to solve for assignment problems, that uses a matrix of reduction.Â
It was developed my Kuhn in 1955, based of the works of two Hungarian mathematicians. Harold Kuhn was an American mathematician who specialized in game theory and other mathematical aspects, including the hungarian method.