解多项式双层规划最优解的参数化方法  

Parametric global optimization for polynomial bilevel programming

作　　者：徐俊彦[1] 苗壮[1] 刘庆怀[1] 

机构地区：[1]长春工业大学基础科学学院,吉林长春130012

出　　处：《东北师大学报（自然科学版）》2015年第3期5-8,共4页Journal of Northeast Normal University(Natural Science Edition)

基　　金：国家自然科学基金资助项目(10771020);吉林省自然科学基金资助项目(20101597)

摘　　要：给出解多项式双层规划最优解的参数化算法.以上层变量为参数,对双层规划下层利用参数化方法求解;得到合理反应集代入上层,使双层问题转化为多项式规划求解.证明了算法的收敛性,数值例子表明算法是可行的.A parametric global optimization algorithm is proposed for solving polynomial bilevel programming problem in this paper. We first describe how we can recast and solve the follower＇s problem of the bileve fomulation as a multi-parametric programming problem, with parameters being the variables of the leader＇s problem. By inserting the obtained reasonable response sets in the leader＇ problem the overall problem is transformed into a set of independent polynomial programming problem. Convergence of the algorithm is established and numerical results are given to show the feasibility.

关 键 词：全局优化 多项式双层规划 非孤立最优解 

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