Assignment problem

The problem of optimally assigning individuals to jobs. It can be formulated as a linear programming problem that is a special case of the transport problem:

maximize

subject to

(origins or supply),

(destinations or demand), where and , which is called the balance condition. The assignment problem arises when and all and are .

If all and in the transposed problem are integers, then there is an optimal solution for which all are integers (Dantzig's theorem on integral solutions of the transport problem).

In the assignment problem, for such a solution is either zero or one; means that person is assigned to job ; the weight is the utility of person assigned to job .

The special structure of the transport problem and the assignment problem makes it possible to use algorithms that are more efficient than the simplex method. Some of these use the Hungarian method (see, e.g., [a5], [a1], Chapt. 7), which is based on the König–Egervary theorem (see König theorem), the method of potentials (see [a1], [a2]), the out-of-kilter algorithm (see, e.g., [a3]) or the transportation simplex method.

In turn, the transportation problem is a special case of the network optimization problem.

A totally different assignment problem is the pole assignment problem in control theory.

References

[a1]	D.B. Yudin, E.G. Gol'shtein, "Linear programming" , Israel Program Sci. Transl. (1965) (In Russian)
[a2]	R. Frisch, "La résolution des problèmes de programme linéaire par la méthode du potentiel logarithmique" Cahier Sém. Econom. , 4 (1956) pp. 20–23
[a3]	K. Murtz, "Linear and combinatorial programming" , Wiley (1976)
[a4]	M. Grötschel, L. Lovász, A. Schrijver, "Geometric algorithms and combinatorial optimization" , Springer (1987)
[a5]	C.H. Papadimitriou, K. Steiglitz, "Combinatorial optimization" , Prentice-Hall (1982)