摘要
给出了一类整数规划问题有唯一最优解的充要条件。并且当有多个最优解时,确定了此整数规划问题的最优解的个数。这解决了文献[1]提出的两个公开问题。
In this paper, a necessary and sufficient condition is given for a class of integer programming which has one and only one optimal solution. The number of the most optimal solutions of this integer programming is determined. When there is more than one. Thus the two open questions given in Ref. are answered.
出处
《东莞理工学院学报》
2005年第5期15-17,22,共4页
Journal of Dongguan University of Technology
关键词
整数规划
最优解
充要条件
integer programming
optimal solutions
necessary and sufficient condition
