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

两层多目标集值优化问题的最优性条件
引用本文:徐飞,王浣尘.两层多目标集值优化问题的最优性条件[J].上海交通大学学报,1999,33(10):1267-1271.
作者姓名:徐飞  王浣尘
作者单位:上海交通大学系统工程研究所,上海 200030
摘    要:在集值分析的框架下,针对上、下层均为多目标且上层问题的集值函数是由下层问题的有效前沿隐性确定的这类两层多目标优化问题,建立了一个通用性结构化模型.研究了模型中构成函数的伴随导数、锥凸性、锥单调性和上局部Lipschitz性.利用参数规划、非光滑分析和非线性分析的理论和方法,获得了模型锥有效解存在的最优必要条件和充分条件

关 键 词:两层规划  多目标优化  集值分析  锥有效解  最优化条件
文章编号:1006-2467(1999)10-1267-05
修稿时间:1998年9月11日

Optimality Conditions for Bilevel Multiobjective Set-Valued Optimization Problems
XU Fei,WANG Huan chen Inst. of Systems Eng.,Shanghai Jiaotong Univ.,Shanghai ,China Inst. of Systems Eng.,Shanghai Jiaotong Univ.,Shanghai ,China.Optimality Conditions for Bilevel Multiobjective Set-Valued Optimization Problems[J].Journal of Shanghai Jiaotong University,1999,33(10):1267-1271.
Authors:XU Fei  WANG Huan chen Inst of Systems Eng  Shanghai Jiaotong Univ  Shanghai  China Inst of Systems Eng  Shanghai Jiaotong Univ  Shanghai  China
Institution:XU Fei,WANG Huan chen Inst. of Systems Eng.,Shanghai Jiaotong Univ.,Shanghai 200030,China Inst. of Systems Eng.,Shanghai Jiaotong Univ.,Shanghai 200030,China
Abstract:This paper investigated the bilevel optimization problems with multiobjective in both upper level and lower level problems in the framework of set value analysis. It established a unified model to deal with the problems, where the set valued function of the upper level problem is determined implicitly by the efficient frontiers of the lower level problem. And then explored the contingent derivatives, cone convexity, cone monotonicity and upper locally Lipschitz property of the set valued functions involved in the model, respectively. Based on these and by the theories and methods of parametric programming, nonsmooth analysis and nonlinear analysis, the necessary and sufficient optimality conditions of cone efficient solutions for the model were obtained.
Keywords:bilevel programming  multiobjective optimization  set  valued analysis  cone efficient solutions  optimality conditions
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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