摘要
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.
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.
基金
Supported by the National Natural Science Foundation of China(19871009)
关键词
有效解
V-约束函数
多目标规划
向量赋值
efficient solution
V-invex function
vector valued saddle point
multiobjective programming
vector valued (α,η)-Lagrange function