分派问题，是一种特殊的整数规划问题。假定有m个人去完成，并指定每人完成其中一项，每项交给其中一个人去完成。应如何分派使总的效率为最高。解分派问题的匈牙利法是从这样一个明显的事实出发的：如果效率矩阵的所有元素aij≥0，而其中存在一组位于不同行不同列的零元素，则只要令对应于这些零元素位置的Xij=1，其余的Xij=0，则目标函数 Dispatch problem is a special integer programming problem. Assume that there are m individuals to complete, and each person to complete one of them, each to give one of them to complete. How to allocate so that the total efficiency of the highest. The Hungarian solution to the problem of distribu- tion is based on the obvious fact that if all the elements of the efficiency matrix aij ≧ 0 and there is a set of zero elements in different columns of different rows, Xij = 1, the rest of Xij = 0, then the objective function