Chinese Quarterly Journal of Mathematics ›› 2005, Vol. 20 ›› Issue (1): 101-110.

Previous Articles    

Another Approach to Multiobjective Programming Problems with V-invex Functions

  

  1. Department of Applied Mathematics, Jiangsu University of Science and Technology, Zhenjiang 212003, China; Department of Applied Mathematics, Dalian University of Technology, Dalian 116024, China; Department of Applied Mathematics, Henan University of Science and Technology, Luoyang 471003, China
  • Received:2004-08-10 Online:2005-03-30 Published:2024-02-28
  • About author: LIU San-ming(1962-),female,native of Pingyao,Shanxi,an associate professor at Jiangsu University of Science and Technology,M.S.D.,engages in multiobjective programming,theory and application of optimization.
  • Supported by:
     Supported by the National Natural Science Foundation of China(19871009);

Abstract: In this paper, optimality conditions for multiobjective programming problems having V-invex objective and constraint functions are considered. An equivalent multiobjective programming problem is constructed by a modification of the objective function. Furthermore, a (α,η)-Lagrange function is introduced for a constructed multiobjective programming problem, and a new type of saddle point is introduced. Some results for the new type of saddle point are given.

Key words: efficient solution, V-invex function, vector valued saddle point, multiobjective programming, vector valued (a,η)-Lagrange function

CLC Number: