生成锥内部凸-锥-类凸集值优化问题的Henig真有效性

该文讨论局部凸空间中的约束集值优化问题. 首先, 在生成锥内部凸-锥-类凸假设下, 建立了Henig真有效解在标量化和Lagrange乘子意义下的最优性条件. 其次, 对集值Lagrange映射引入Henig真鞍点的概念, 并用这一概念刻画了Henig真有效解. 最后, 引入了一个标量Lagrange对偶模型, 并得到了关于Henig真有效解的对偶定理. 另外, 该文所得结果均不需要约束序锥有非空的内部.     

带约束条件集值优化问题近似Henig有效解集的连通性

研究了带约束条件集值优化问题近似Henig有效解集的连通性.在实局部凸Hausdorff空间中,讨论了可行域为弧连通紧的,目标函数为C-弧连通的条件下,带约束条件集值优化问题近似Henig有效解集的存在性和连通性.并给出了带约束条件集值优化问题近似Henig有效解集的连通性定理.     

Well-posedness and stability in vector optimization problems using Henig proper efficiency

In this article, we study well-posedness and stability aspects for vector optimization in terms of minimizing sequences defined using the notion of Henig proper efficiency. We justify the importance of set convergence in the study of well-posedness of vector problems by establishing characterization of well-posedness in terms of upper Hausdorff convergence of a minimizing sequence of sets to the set of Henig proper efficient solutions. Under certain compactness assumptions, a convex vector optimization problem is shown to be well-posed. Finally, the stability of vector optimization is discussed by considering a perturbed problem with the objective function being continuous. By assuming the upper semicontinuity of certain set-valued maps associated with the perturbed problem, we establish the upper semicontinuity of the solution map.     

Super efficiency in vector optimization with nearly convexlike set-valued maps

In this paper, we establish a scalarization theorem and a Lagrange multiplier theorem for super efficiency in vector optimization problem involving nearly convexlike set-valued maps. A dual is proposed and duality results are obtained in terms of super efficient solutions. A new type of saddle point, called super saddle point, of an appropriate set-valued Lagrangian map is introduced and is used to characterize super efficiency.     

集值优化强有效解的广义二阶锥方向导数刻画

在实赋范线性空间中考虑集值优化问题的强有效性．借助Henig扩张锥和基泛函的性质,利用广义二阶锥方向相依导数,得到受约束于集值映射的优化问题,取得强有效元的二阶最优性必要条件．当目标函数为近似锥一次类凸映射时,利用强有效点的标量化定理,得到集值优化问题,取得强有效元的二阶充分条件．     

Connectedness of Henig Weakly Efficient Solution Set for Set-Valued Optimization Problems

In this paper, we study Henig weakly efficient solutions for set-valued optimization problems. The connectedness of the Henig weakly efficient solution set is proved under the condition that the objective function be a cone-arcwise connected set-valued mapping. As an application of the result, we establish the connectedness of the set of super efficient solutions.     

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

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

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

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

SEPARABLE CONDITIONS AND SCALARIZATION OF BENSON PROPER EFFICIENCY

Under the assumption that the ordering cone has a nonempty interior and is separable （or the feasible set has a nonempty interior and is separable）, we give scalarization theorems on Benson proper effciency. Applying the results to vector optimization problems with nearly cone-subconvexlike set-valued maps, we obtain scalarization theorems and Lagrange multiplier theorems for Benson proper effcient solutions.     

Hartley Proper Efficiency in Multiobjective Optimization Problems with Locally Lipschitz Set-valued Objectives and Constraints

In this paper we give necessary conditions for Hartley proper efficiency in a vector optimization problem whose objectives and constraints are described by nonconvex locally Lipchitz set-valued maps. The obtained necessary conditions are written in terms of a Lagrange multiplier rule. Our approach is based on a reduction theorem which leads the problem of studying proper efficiency to a scalar optimization problem whose objective is given by a function of max-type. Sufficient conditions for Hartley proper efficiency are also considered.     

Optimality conditions of the set-valued optimization problem with generalized cone convex set-valued maps characterized by contingent epiderivative

In this paper, firstly, a new notion of generalized cone convex set-valued map is introduced in real normed spaces. Secondly, a property of the generalized cone convex set-valued map involving the contingent epiderivative is obtained. Finally, as the applications of this property, we use the contingent epiderivative to establish optimality conditions of the set-valued optimization problem with generalized cone convex set-valued maps in the sense of Henig proper efficiency. The results obtained in this paper generalize and improve some known results in the literature.     

集值映射向量优化问题的ε-超鞍点和ε-对偶定理

本文研究集值映射向量优化问题的ε-超鞍点和ε-对偶定理。在集值映射是近似广义锥次似凸的假设下，利用ε-超有效解的标量化和Lagrange乘子定理，建立和证明了关于ε-超有效解的鞍点和对偶定理。     

Optimality conditions for Henig and globally proper efficient solutions with ordering cone has empty interior

In this paper, we consider the set-valued vector optimization problems with constraint in locally convex spaces. We present the necessary and sufficient conditions for Henig efficient solution pair, globally proper efficient solution pair and super efficient solution pair without the ordering cones having the nonempty interior.     

Superefficiency in Vector Optimization with Nearly Subconvexlike Set-Valued Maps

In the framework of locally convex topological vector spaces, we establish a scalarization theorem, a Lagrange multiplier theorem and duality theorems for superefficiency in vector optimization involving nearly subconvexlike set-valued maps.     

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     

Optimality conditions for proper efficient solutions of vector set-valued optimization

Based on the concept of an epiderivative for a set-valued map introduced in J. Nanchang Univ. 25 (2001) 122-130, in this paper, we present a few necessary and sufficient conditions for a Henig efficient solution, a globally proper efficient solution, a positive properly efficient solution, an f-efficient solution and a strongly efficient solution, respectively, to a vector set-valued optimization problem with constraints.     

集值优化问题在Henig真有效解意义下的导数型最优性条件

给出实的赋范空间中集值映射的Henig真有效解集的一些性质,并利用集值映射的相依上图导数和集值映射的次微分给出了集值优化问题Henig真有效解的最优性条件的充要条件.     

The Ekeland variational principle for Henig proper minimizers and super minimizers

In this paper we consider, for the first time, approximate Henig proper minimizers and approximate super minimizers of a set-valued map F with values in a partially ordered vector space and formulate two versions of the Ekeland variational principle for these points involving coderivatives in the sense of Ioffe, Clarke and Mordukhovich. As applications we obtain sufficient conditions for F to have a Henig proper minimizer or a super minimizer under the Palais-Smale type conditions. The techniques are essentially based on the characterizations of Henig proper efficient points and super efficient points by mean of the Henig dilating cones and the Hiriart-Urruty signed distance function.     

一类集值映射向量优化问题的ε-有效解

集值映射向量优化问题是最优化理论中的一个重要方向.在集值映射为生成锥内部-锥一类凸(简记为ic-锥类凸)的假设条件下,利用择一定理,给出了集值映射向量优化问题ε-弱有效解和ε-有效解的最优性条件和ε-Lagrange乘子定理,是弱有效解和有效解相应结果的推广.     

锥似凸映射下集值优化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.