Journal of Jilin University Science Edition

Previous Articles     Next Articles

Duality of Invex Convex Multiobjective Programming

WANG Cailing1, YANG Xue2   

  1. 1. College of Mathematics, Jilin University, Changchun 130012, China;2. The Basic Teaching, Changchun Architecture & Civil Engineering College, Changchun 130600, China
  • Received:2015-08-10 Online:2016-03-26 Published:2016-03-23
  • Contact: WANG Cailing E-mail:wangcljl@163.com

Abstract:

The author gave a class of composite vector valued invariant invex function, and applied it to the nonsmooth multiobjective programming problem. The author established a general Craven type of duality and proved weak, strong and converse duality theorems under the nonsmooth composite multiobjective programming.

Key words: convex programming, multiobjective problem, duality

CLC Number: 

  • O221.6