![example of assignment problem in operational research example of assignment problem in operational research](https://slidetodoc.com/presentation_image_h/d65c9bf7ba2d6c6b8039353f283543c0/image-2.jpg)
The following example shows the problem of a flat share who wants to assign specific jobs to cleaners. The example illustrates a location problem, one of the applications of the QAP. In most cases the output table has a quadratic matrix form. With the Hungarian Method such problems can be easily solved without a lot of calculating steps. (i.e.) we could have made an assignment at (3, 5) deleting other zero in the row 3 and zero in column 5 and making the last assignment at (4, 3). Marriage Problem: A father wants to minimize his marriage gift and wants to maximize the sympathy of his daughters to the men. One more assignment (as a solution) is possible in this problem. The evaluation will be the qualification of a worker or the costs to assign the order to a machine. cient algorithms for solving large scale assignment problems 23,24,27,34,43,44. Job Problem: A number of work assignments has to be distributed to an equally number of workers or machines. European Journal of Operational Research 110 (1998) 314-325.
![example of assignment problem in operational research example of assignment problem in operational research](https://s2.studylib.net/store/data/011696107_1-cd4b162886621fe7c8cf3bc0690592f3-768x994.png)
Every customer has its own price idea on the good he is interested.
![example of assignment problem in operational research example of assignment problem in operational research](https://i.ytimg.com/vi/qAuzFrnvGMY/maxresdefault.jpg)
Auction Model: A number of goods has to be evenly distrubuted to an equal number of customer. Typical examples of assignment problems are: The assignment problem is a special case of the transportation problem in which the number of provider and consumer are equal and supply (ai) and demand (bj) amounts are defined as 1. The Hungarian Method is an algorithm developed by Harold Kuhn to solve assignment problems in polynomial time. The total amount of the product a particular factory makes is fixed and so is the total amount a particular outlet can store.