1) Epiderivative
上图导数
1.
The concept of the generalized gradient in sense of strong efficiency is introduced by epiderivative for a set-valued map in ordered Banach spaces.
在锥序Banach空间中利用集值映射的上图导数引进了强有效意义下的广义梯度,在下C-半连续条件下,利用凸集分离定理证明了该广义梯度的存在性,由此建立了集值向量优化问题强有效解在广义梯度下的最优性条件。
2) contingent epiderivatives
伴随上图导数
3) contingent epiderivative
余切上图导数
1.
A representation of contingent epiderivative of the value map in vector optimization;
向量优化中值映射的余切上图导数的一个表示
2.
Two representations of contingent epiderivative of the value map is given in terms of the derivative of the objective function,the contingent derivative of the constraint .
借助目标函数的导数、约束映射的余切导数及拉格朗日映射给出了值映射的余切上图导数的两个表示。
3.
With contingent epiderivative of set-valued mapping,we gain the sufficient conditions of minimal solution and strict minimal solution of set-valued optimization problem.
借助集值映射的余切上图导数,给出了集值优化问题取得极小解和严格极小解的充分条件。
4) Contingent-epiderivative
上图相依导数
5) Second-order epi-derivatives
二阶上图导数
6) contingent epiderivative
切上导数
1.
In this paper, the necessary and sufficient conditions of Geoffrion efficient solutions in vector set-valued optimization problem with vector variational inequality are obtained by using the concept of contingent epiderivative, which has been introduced by Jahn and Rauh.
利用Jahn与Rauh提出的集值映射的切上导数概念,解决了以向量变分不等式的形式给出向量集值优化问题的Geoffrion有效解的充分必要条件。
2.
In this paper, the necessary and sufficient conditions of various proper efficient solutions in vector set-valued optimization problem are obtained by using the concept of contingent epiderivative,which has been introduced by Jahn and Rauh.
利用Jahn与Rauh提出的集值映射的切上导数概念 ,给出了向量集值映射最优化问题的各种有效解的充分与必要条
3.
By using the concept of contingent epiderivative,radial contingent epiderivative,it presents the necessary and sufficient conditions for weakly efficient solution,globally efficient solution,Henig efficient solution and C-superefficient solution to the vector equilibrium problems.
利用映射的切上导数,径向切上导数给出了向量均衡问题弱有效解,整体有效解,Hen ig有效解以及C-超有效解的充分必要条件。
补充资料：图的减缩图(或称图子式)
图的减缩图(或称图子式)
minor of a graph
图的减缩图(或称图子式)【.皿以ofa脚户;MHHoPrpa中a」【补注】设G是一个图(graph)(可以有环及多重边).G的一个减缩图(nullor)是从G中接连进行下述运算而得的任何一个图: i)删去一条边; 五)收缩一条边; 说)去掉一个孤立顶点. NRobe由on与P.D.Se脚aour的图减缩定理(脚Ph nl的。r theon习11)如下所述:已知有限图的无穷序列G，，GZ，…，则存在指标i
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条