Nearly Subconvexlike Set-Valued Maps and Vector Optimization Problems

This paper gives several characterizations of nearly subconvexlike set-valued maps (see Ref. 1) and shows that a weakly efficient solution and a Benson properly efficient solution of a vector optimization problem with nearly-subconvexlike objectives and constraints can be expressed in terms of saddle points defined in a suitable sense.     

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

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

集值映射多目标半定规划的Benson真有效性

将多目标半定规划问题推广到集值映射,在广义锥-次类凸条件下,在Benson真有效性意义下研究了问题的标量化,Lagrange函数与无约束化,真鞍点条件和对偶性.     

序线性空间中广义半似凸集值映射向量优化的Benson真有效性

在序线性空间中建立了广义半似凸集值映射的择一定理.利用向量闭包,引进了集值优化的Benson真有效解.在广义半似凸的假设下,获得了Benson真有效性意义下的标量化定理,Lagrangian乘子定理和鞍点定理.     

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

引进了关于集值映射的(1,α)-阶Clarke导数,(1,α)-阶邻接导数,(1,α)-阶伴随导数概念;应用它们导出了具Slater约束规格的集值优化问题的Benson真有效解的广义导数型Kuhn-Tucker最优性条件。     

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

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

New Generalized Convexity Notion for Set-Valued Maps and Application to Vector Optimization

In this paper, we introduce a new generalized convexity notion for set-valued maps, called ic-cone-convexlikeness, and use it as the main tool to derive an alternative theorem and necessary conditions for efficient, weakly efficient, and Benson properly efficient solutions of the problem of minimizing a set-valued map subject to set-valued constraints. Our results are valid for a class of optimization problems broader than that of the problems considered in Refs. 1--6 and generalize the corresponding results of these references.Communicated by H. P. BensonThe author thanks the anonymous referees for their remarks.     

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

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

Characterizations of the Benson Proper Efficiency for Nonconvex Vector Optimization

Under generalized cone-subconvexlikeness for vector-valued mappings in locally-convex Hausdorff topological vector spaces, a Gordan-form alternative theorem is derived. Some characterizations of the Benson proper efficiency under this generalized convexity are established in terms of scalarization, Lagrangian multipliers, saddle-point criterion, and duality.     

Strong Duality with Proper Efficiency in Multiobjective Optimization Involving Nonconvex Set-Valued Maps

In this paper, we consider some dual problems of a primal multiobjective problem involving nonconvex set-valued maps. For each dual problem, we give conditions under which strong duality between the primal and dual problems holds in the sense that, starting from a Benson properly efficient solution of the primal problem, we can construct a Benson properly efficient solution of the dual problem such that the corresponding objective values of both problems are equal. The notion of generalized convexity of set-valued maps we use in this paper is that of near-subconvexlikeness.