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

弱线性双层规划问题的罚分解方法
引用本文:洪云飞[] 、郑跃[] 、陈忠[]. 弱线性双层规划问题的罚分解方法[J]. 西南师范大学学报(自然科学版), 2017, 42(9)
作者姓名:洪云飞[] 、郑跃[] 、陈忠[]
摘    要:主要研究弱线性双层规划问题的求解方法.首先利用线性规划的对偶理论和罚函数方法思想,将弱线性双层规划问题转化为一个单层非线性规划问题.进一步把该单层优化问题分解为两个含有罚参数的线性规划问题,设计了一个罚分解方法,并用一个简单算例说明了所提出方法的可行性.

关 键 词:双层规划; 对偶理论; 罚分解方法

On a Penalty Decomposition Method for Solving Weak Linear Bilevel Programming Problems
HONG Yun-fei[],ZHENG Yue[],CHEN Zhong[]. On a Penalty Decomposition Method for Solving Weak Linear Bilevel Programming Problems[J]. Journal of southwest china normal university(natural science edition), 2017, 42(9)
Authors:HONG Yun-fei[]  ZHENG Yue[]  CHEN Zhong[]
Abstract:In this paper,a solution method has mainly been discussed to solve the weak linear bilevel programming problems.Using the dual theory of linear programming and the idea of penalty function method,the weak linear bilevel programming problem has firstly been transformed into a single-level nonlinear programming problem.Furthermore,the latter problem has been decomposed into two linear programming problems which involve a penalty parameter.Finally,a penalty decomposition method has been present and a simple numerical example used to illustrate the feasibility of the proposed method.
Keywords:
本文献已被 CNKI 等数据库收录!
点击此处可从《西南师范大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《西南师范大学学报(自然科学版)》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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