吉林大学学报（理学版）2019，Vol.57Issue(5)：1060-1064,5.DOI:10.13413/j.cnki.jdxblxb.2019139
弱凸多目标规划问题的最优性条件
Optimality Conditions of Multiobjective Programming Problems Based on Weakly Convex 1 预备知识
摘要
Abstract
On the basis of a class of global optimality conditions ,we used abstract subdifferential and abstract normal cone to study m ultiobjective prog ram ming problems , gave sufficient conditions for effective solutions of w eakly convex multiobjective optimization problem s , and ex tended the single objective optimization problem to m ultiobjective optimization problems .关键词
弱凸/最优性条件/次微分/多目标规划Key words
w eakly convex /optimality condition /subdifferential /multiobjective programming分类
数理科学引用本文复制引用
王彩玲,高慧岩..弱凸多目标规划问题的最优性条件[J].吉林大学学报（理学版）,2019,57(5):1060-1064,5.基金项目
国家自然科学基金(批准号:11871244). （批准号:11871244）
