| 改进的“第k最好算法” |
| |
| 引用本文： | 张永,朴凤华.改进的“第k最好算法”[J].河北职业技术学院学报,2008,8(6). |
| |
| 作者姓名： | 张永 朴凤华 |
| |
| 作者单位： | 廊坊师范学院,河北,廊坊,065000 |
| |
| 摘 要： | "第k最好算法"是求双层线性规划问题最优解的有效方法之一.对前人的"第k最好算法"进行了改进,提出了按最小下降量原则对容许集的极点按上层目标函数值由大到小依次进行枚举的方法,从而减小的求解的计算量.
|
| 关 键 词： | 二层线性规划 "第k最好算法" 最小下降量 |
Modified Kth-best Algorithm |
| |
| ZHANG Yong PIAO Feng-hua.Modified Kth-best Algorithm[J].Journal of Hebei Polytechnic,2008,8(6). |
| |
| Authors: | ZHANG Yong PIAO Feng-hua |
| |
| Abstract: | Kth-best algorithm is one of the effective method to resolve the bilevel linear programming.In this paper,we modify kth-best algorithm,putforward a kind of algorithm to find the optimal solution of the bilevel linear programming which obey the minimum descent principle and enumerate the vertex of admissible set from big object function value to small,it make the problem more simple. |
| |
| Keywords: | bilevel linear programming kth-best algorithm minimum desent |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
