摘要
在实际应用中 ,优化问题的多重最优解具有非常重要的作用 .但对于如何求指派问题的多重最优解 ,目前在许多文献中却未有论述 .本文讨论了该问题 。
In practical decision making,the alternate optimal solutions of optimization models are very important.But at present,there are no any special methods reported which can be used to find alternate optimal solutions for assignment problem.This paper discusses the problem and presents a branch and bound technique to find alternate optimal solutions for assignment problem.
出处
《长沙铁道学院学报》
CSCD
2000年第1期69-72,共4页
Journal of Changsha Railway University
基金
湖南省自然科学基金项目!( 99JJY2 0 0 64 )
关键词
线性规划
指派问题
多重最优解
分枝定界
linear programming
assignment problem
alternate optimal solutions
branch and bound
