弱线性双层规划问题的罚分解方法  

On a Penalty Decomposition Method for Solving Weak Linear Bilevel Programming Problems

作　　者：洪云飞 郑跃[3] 陈忠 

机构地区：[1]长江大学期刊社,湖北荆州434023 [2]长江大学信息与数学学院,湖北荆州434023 [3]淮北师范大学管理学院,安徽淮北235000

出　　处：《西南师范大学学报（自然科学版）》2017年第9期11-15,共5页Journal of Southwest China Normal University(Natural Science Edition)

基　　金：国家自然科学基金项目(11501233;61273179)

摘　　要：主要研究弱线性双层规划问题的求解方法.首先利用线性规划的对偶理论和罚函数方法思想,将弱线性双层规划问题转化为一个单层非线性规划问题.进一步把该单层优化问题分解为两个含有罚参数的线性规划问题,设计了一个罚分解方法,并用一个简单算例说明了所提出方法的可行性.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,apenalty decomposition method has been present and a simple numerical example used to illustrate the feasibility of the proposed method.

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

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