改进的“第k最好算法”  

Modified Kth-best Algorithm

作　　者：张永[1] 朴凤华[1] 

机构地区：[1]廊坊师范学院,河北廊坊065000

出　　处：《廊坊师范学院学报（自然科学版）》2008年第6期19-20,25,共3页Journal of Langfang Normal University(Natural Science Edition)

摘　　要："第k最好算法"是求双层线性规划问题最优解的有效方法之一。对前人的"第k最好算法"进行了改进,提出了按最小下降量原则对容许集的极点按上层目标函数值由大到小依次进行枚举的方法,从而减小的求解的计算量。Kth-best algorithm is one of the effective method to resolve the bilevel hnear 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.

关 键 词：二层线性规划 “第k最好算法” 最小下降量 

分 类 号：O22[理学—运筹学与控制论]