|
|||||
|
|
| 一类整数规划问题有唯一最优解的充要条件 | |
| 引用本文： | 林斐. 一类整数规划问题有唯一最优解的充要条件[J]. 东莞理工学院学报, 2005, 12(5): 15-17,22 |
| 作者姓名： | 林斐 |
| 作者单位： | 漳州师范学院计算中心 福建 |
| 摘 要： | 给出了一类整数规划问题有唯一最优解的充要条件.并且当有多个最优解时,确定了此整数规划问题的最优解的个数.这解决了文献[1]提出的两个公开问题. |
| 关 键 词： | 整数规划 最优解 充要条件 |
| 文章编号： | 1009-0312（2005）05-0015-03 |
| 收稿时间： | 2005-07-11 |
| 修稿时间： | 2005-07-11 |
A Necessary and Sufficient Condition for Optimal Solutions of a Class of Integer Programming |
|
| Lin Fei. A Necessary and Sufficient Condition for Optimal Solutions of a Class of Integer Programming[J]. Journal of Dongguan Institute of Technology, 2005, 12(5): 15-17,22 | |
| Authors: | Lin Fei |
| Abstract: | 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. |
| Keywords: | integer programming optimal solutions necessary and sufficient condition |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |