J4 ›› 2012, Vol. 50 ›› Issue (4): 698-700.

Previous Articles     Next Articles

Optimality Conditions of Multiobjective Programming Problerms Based on the Astract Convexity

WANG Cailing1, GAO Huiyan2   

  1. 1. College of Mathematics, Jilin University, Changchun 130012, China;
    2. Jincai JointStock Company, Beijing Zhongke, Beijing 100083, China
  • Received:2012-05-02 Online:2012-07-01 Published:2012-09-07
  • Contact: WANG Cailing E-mail:wangcl-jl@163.com.

Abstract:

 Optimality conditions of multi-objective programming problems for weak convex function were given via the abstract subdifferentiation on the basis of the  optimality conditions for the single objective optimization problem. New results were got.

Key words: optimality conditions, abstract convexity, multiobjective programming

CLC Number: 

  •