首页 | 本学科首页   官方微博 | 高级检索  
     检索      

通过平衡点求线性二层规划(LBP)的最优解
引用本文:邹腊英,叶祥企,饶区琴.通过平衡点求线性二层规划(LBP)的最优解[J].江西科学,2007,25(5):602-604.
作者姓名:邹腊英  叶祥企  饶区琴
作者单位:江西师范大学,江西,南昌,330027
摘    要:关于线性二层规划的求解问题。先利用K-T充分条件和罚函数法先将线性二层规划转化为无约束问题,再由无约束问题得到简单的参数线性规划,通过单纯形法解参数线性规划,即得到平衡点,再判断平衡点是否为原二层规划的最优解。

关 键 词:线性二层规划  K-T充分条件  罚函数  无约束问题  参数线性规划  单纯形法  平衡点
文章编号:1001-3679(2007)05-0602-03
修稿时间:2007-07-03

Finding the Optimal Solution of Linear Bilevel Program by the Equilibrium Point
ZOU La-ying,YE Xiang-qi,RAO Qu-qin.Finding the Optimal Solution of Linear Bilevel Program by the Equilibrium Point[J].Jiangxi Science,2007,25(5):602-604.
Authors:ZOU La-ying  YE Xiang-qi  RAO Qu-qin
Institution:Jiangxi Normal University,Jiangxi Nanchang 330027 PRC
Abstract:In this paper,linear bilevel programming problem(LBP) is considered.The first,(LBP) is changed into no constrained problem by K-T conditions and the penalized method,then,change the no constrained problem into the parametric linear program,and find the solutions of the parametric linear program by the simplex method,the solutions is just the equilibrium point,last,determine which equilibrium point is the optimal solution of LBP.
Keywords:Linear bilevel program  K-T condition  The penalized method  No constrained problem  Parametric linear program  The simplex method  The equilibrium point
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号