摘要
分析和研究一类广义指派决策问题，给出了该问题的线性规划模型，并把该问题转化为传统指派决策问题，使得该问题可以用著名的匈牙利算法求其最优解，从而为该问题找到一个理想、简便而有效的求解方法。给出了一个数值例子。
This paper presented an integer linear programming model for the generalized assignment problem. So the generalized assignment problem is ingeniously reduced to a traditional assignment prolbem, and its optimal solution can be easily obtained by the famous: Hungary algorithm. Finally, an example is given to illustrate the solving steps of the generalized assignment problem.
出处
《控制与决策》
EI
CSCD
北大核心
1999年第3期272-275,共4页
Control and Decision
关键词
线性规划
有效算法
指派决策
企业管理
assignment problem, linear programming, efficiency algorithm
