弱凸多目标规划问题的最优性条件  

Optimality Conditions of Multiobjective Programming Problems Based on Weakly Convex

作　　者：王彩玲[1] 高慧岩 WANG Cailing;GAO Huiyan(College of Mathematics, Jilin University, Changchun 130012, China;Beijing Sinodata Technology Co., Ltd., Beijing 100091, China)

机构地区：[1]吉林大学数学学院,长春130012 [2]北京中科金财科技股份有限公司,北京100091

出　　处：《吉林大学学报（理学版）》2019年第5期1060-1064,共5页Journal of Jilin University:Science Edition

基　　金：国家自然科学基金(批准号:11871244)

摘　　要：在一类单目标全局最优性条件的基础上,利用抽象次微分与抽象法锥研究多目标规划问题,给出弱凸多目标优化问题有效解的充分条件,并将单目标优化问题推广到多目标优化问题.On the basis of a class of global optimality conditions,we used abstract subdifferential and abstract normal cone to study multiobjective programming problems,gave sufficient conditions for effective solutions of weakly convex multiobjective optimization problems,and extended the single objective optimization problem to multiobjective optimization problems.

关 键 词：弱凸 最优性条件 次微分 多目标规划 

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