Another Approach to Multiobjective Programming Problems with V-invex Functions  

作　　者：LIUSan-ming FENGEn-min LIXiao-shen 

机构地区：[1]DepartmentofAppliedMathematics,JiangsuUniversityofScienceandTechnology,Zhenjiang212003,China [2]DepartmentofAppliedMathematics,DalianUniversityofTechnology,Dalian116024,China [3]DepartmentofAppliedMathematics,HenanUniversityofScienceandTechnology,Luoyang471003,China

出　　处：《Chinese Quarterly Journal of Mathematics》2005年第1期101-110,共10页数学季刊（英文版）

基　　金：Supported by the National Natural Science Foundation of China(19871009)

摘　　要：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.

关 键 词：efficient solution V-invex function vector valued saddle point multiobjective programming vector valued (α η)-Lagrange function 

分 类 号：O221.6[理学—运筹学与控制论]