Journal of Jilin University Science Edition ›› 2019, Vol. 57 ›› Issue (5): 1060-1064.

Previous Articles     Next Articles

Optimality Conditions of Multiobjective ProgrammingProblems Based on Weakly Convex

WANG Cailing1, GAO Huiyan2   

  1. 1. College of Mathematics, Jilin University, Changchun 130012, China;2. Beijing Sinodata Technology Co., Ltd.,  Beijing 100091, China
  • Received:2019-04-17 Online:2019-09-26 Published:2019-09-19
  • Contact: WANG Cailing E-mail:wangcl@jlu.edu.cn

Abstract: 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.

Key words: weakly convex, optimality condition, subdifferential, multiobjective programming

CLC Number: 

  • O221