摘要
文献(1)讨论了一般的集值映像的变分不等式问题并把所得结果应用于凸数学规划问题的研究。本文将在[I]的基础上,把上述结果推广到多目标规划问题的研究。
The paper[1] got some results of variational inequalities of Set-valued mapping and applied them to research of convex mathematical programming. In this paper, we apply these results to the research of multiple objective mathematical programming.
关键词
变分不等式
多目标规划
鞍点问题
弱有效解
η-凸
Variational inequalities, multiple objective mathematical programming, problem of saddle point, Weak effective solution, η-convex,