摘要
探讨了求解两层线性规划的几种方法之间的关系，数值结果说明了所得结论的正确性．
The paper deals with the relations among several methods for bilevel linear programming problems, with numerical examples agreeing with the results very well. We also show that the strong dual theorem of linear programming is equivalent to the KarushKuhnTucker conditions.
出处
《西安电子科技大学学报》
EI
CAS
CSCD
北大核心
1997年第4期496-501,共6页
Journal of Xidian University
基金
国家教委资助年轻教师基金
关键词
两层线性规划
线性规划
解法
罚函数法
对偶
bilevel linear programming penalty functions method dual KarushKuhnTucker conditions
