非凸向量集值优化Benson真有效解的最优性条件与对偶

在无需偏序锥内部非空的情况下给出了非凸约束向量集值优化Benaon真有效解一种加细的最优性条件，并建立了向量集值优化Benson真有效解一种改进的Lagrange乘子型对偶，它比已有的Lagrange乘子型对偶具有较好的对偶性。     

集值映射向量优化问题ε-超有效解集的连通性

本文在赋范向量空间中讨论集值映射向量优化问题的ε-超有效性，在锥-半连续和广义锥-次类凸的假设条件下，获得了ε-超有效点(解)集的连通性结果．     

向量集值优化超有效解的对偶问题

借助于Contingent切锥和集值映射的上图而引入的有关集值映射的Contingent切导数，对约束集值优化问题的超有效解建立了最优性Kuhn Tucker必要及充分性条件,借此建立了向量集值优化超有效解的Wolfe型和Mond Weir型对偶定理.     

向量集值映射的共轭对偶

借助抽象算子将共轭映射的概念的到抽象空间,引入了集值映射的共轭映射和次梯度,据此讨论了集值映射共轭对偶的全局稳定性。     

集值优化问题在有效意义下的最优性条件

本文在赋范空间中,讨论集值优化问题的有效元导数型最优性条件.当目标映射和约束映射的下方向导数存在时,在近似锥次类凸假设下利用有效点的性质和凸集分离定理得到了集值优化问题有效元导数型Kuhn-Thcker必要条件,在可微Г-拟凸性的假设下得到了Kuhn-Tucker最优性充分条件;此外利用集值映射沿弱方向锥的导数的特性给出了有效解最优性的另一种刻画.     

超有效元意义下集值优化的最优性条件

该文在Hausdorff局部凸拓扑向量空间考虑约束集值优化问题(SOP)在超有效意义下的Fritz John条件和Kuhn-Tucker条件.首先借助集值映射的下半可微的概念给出这种空间中集值映射导数的定义, 据此讨论了超有效元的Fritz John最优性条件.最后, 给出约束集值优化问题(SOP)取得超有效元的充分条件.     

集值映射向量优化问题的ε—超有效解

本文引进了集值映射向量优化问题的ε－超有效解概念,并在集值映射为近似广义锥次似凸的假设下,建立了关于ε－超有效解的标量化定理和Lagrange乘子定理。     

集值向量优化问题ε-超有效解的性质

本文讨论了ε-超有效点的性质，并给出了ε-超有效解集连通性的证明．     

集值向量优化问题ε-弱有效集的拓扑性质

本文研究集值向量优化问题ε-弱有效集的拓扑性质，证明了ε-弱有效解集的存在性、闭性、紧性和连通性。     

集值映射向量优化的Benson真有效性

本文首先将单值映射的锥次类凸概念推广到集值映射，并对锥次类凸集值映射给出几个等价刻划和一个择一性定理。然后，利用这些概念与结果来确定拓扑线性空间中带集值映射的向量优化问题的Ｂｅｎｓｏｎ真有效性，获得两个标量化结果和两个Ｌａｇｒａｎｇｅ乘子定理，在定义了一个适当的集值Ｌａｇｒａｎｇｅ映射并对其引入真鞍点的概念之后，又建立了Ｂｅｎｓｏｎ真有效性的一个充分条件和一个充要条件，最后还讨论了两个对偶问题。     

关于向量集值优化的Benson真有效性

对广义锥次数凸向量集值优化问题Benson真有效性解的标量化问题进行了研究,借助于一种新的择一性定理建立了广义锥次类凸向是集值优化问题Benson真有效解的Lagrange乘子型定理并讨论了乘子型对偶问题。     

集值映射的次微分以及最优性条件

基于已有的集值映射的弱次微分的概念,定义了集值映射的Henig全局次微分,研究了它的存在性条件以及运算性质．利用这一概念,分别给出了具约束向量集值最优化问题的Henig全局有效解对的必要性条件和充分性条件．     

锥似凸映射下集值优化Henig有效解的高阶最优性条件(英文)

This paper deals with higher-order optimality conditions for Henig effcient solutions of set-valued optimization problems.By virtue of the higher-order tangent sets, necessary and suffcient conditions are obtained for Henig effcient solutions of set-valued optimization problems whose constraint condition is determined by a fixed set.     

集值优化问题的Benson真有效解的广义导数型最优性条件

引进了集值映射关于锥的Clarke切导数, Adjacent切导数与Contingent切导数概念;应用它们导出了具Slater约束规格的集值优化问题的Benson真有效解的广义导数型最优性条件．     

Benson Proper Efficiency in the Vector Optimization of Set-Valued Maps

This paper extends the concept of cone subconvexlikeness of single-valued maps to set-valued maps and presents several equivalent characterizations and an alternative theorem for cone-subconvexlike set-valued maps. The concept and results are then applied to study the Benson proper efficiency for a vector optimization problem with set-valued maps in topological vector spaces. Two scalarization theorems and two Lagrange multiplier theorems are established. After introducing the new concept of proper saddle point for an appropriate set-valued Lagrange map, we use it to characterize the Benson proper efficiency. Lagrange duality theorems are also obtained     

Duality Results for Generalized Vector Variational Inequalities with Set-Valued Maps

In this paper, we introduce new dual problems of generalized vector variational inequality problems with set-valued maps and we discuss a link between the solution sets of the primal and dual problems. The notion of solutions in each of these problems is introduced via the concepts of efficiency, weak efficiency or Benson proper efficiency in vector optimization. We provide also examples showing that some earlier duality results for vector variational inequality may not be true. This work was supported by the Brain Korea 21 Project in 2006.     

Duality in Vector Optimization in Banach Spaces with Generalized Convexity

We consider a vector optimization problem with functions defined on Banach spaces. A few sufficient optimality conditions are given and some results on duality are proved.     

Theorems of the Alternative and Optimization with Set-Valued Maps

In this paper, the concept of generalized cone subconvexlike set-valued mapsis presented and a theorem of alternative for the system of generalizedinequality–equality set-valued maps is established. By applying thetheorem of the alternative and other results, necessary and sufficientoptimality conditions for vector optimization problems with generalizedcone subconvexlike set-valued maps are obtained.