Scalarization of Set-Valued Optimization Problems with Generalized Cone Subconvexlikeness in Real Ordered Linear Spaces

In real ordered linear spaces, an equivalent characterization of generalized cone subconvexlikeness of set-valued maps is firstly established. Secondly, under the assumption of generalized cone subconvexlikeness of set-valued maps, a scalarization theorem of set-valued optimization problems in the sense of ?-weak efficiency is obtained. Finally, by a scalarization approach, an existence theorem of ?-global properly efficient element of set-valued optimization problems is obtained. The results in this paper generalize and improve some known results in the literature.     

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

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

Set-valued increasing-along-rays maps and well-posed set-valued star-shaped optimization

In this paper we introduce a class of set-valued increasing-along-rays maps and present some properties of set-valued increasing-along-rays maps. We show that the increasing-along-rays property of a set-valued map is close related to the corresponding set-valued star-shaped optimization. By means of increasing-along-rays property, we investigate stability and well-posedness of set-valued star-shaped optimization.     

Characterizations of Solutions for Vector Equilibrium Problems

In this paper, we characterize the solutions of vector equilibrium problems as well as dual vector equilibrium problems. We establish also vector optimization problem formulations of set-valued maps for vector equilibrium problems and dual vector equilibrium problems, which include vector variational inequality problems and vector complementarity problems. The set-valued maps involved in our formulations depend on the data of the vector equilibrium problems, but not on their solution sets. We prove also that the solution sets of our vector optimization problems of set-valued maps contain or coincide with the solution sets of the vector equilibrium problems.     

On optimization problems with set-valued objective maps

In this paper, we consider constrained optimization problems with set-valued objective maps. First, we define three types of quasi orderings on the set of all non-empty subsets in n-dimensional Euclidean space and investigate their properties. Next, by using these orderings, we define the concepts of the convexities to set-valued maps and investigate their properties. Finally, based on these results, we define the concepts of optimal solutions to constrained optimization problems with set-valued objective maps and characterize their properties.     

On Optimization Problems with Set-Valued Objective Maps: Existence and Optimality

In this paper, we consider constrained optimization problems with set-valued objective maps. First, we define three types of quasi orderings on the set of all non-empty subsets of n-dimensional Euclidean space. Second, by using these quasi orderings, we define the concepts of lower semi-continuity for set-valued maps and investigate their properties. Finally, based on these results, we define the concepts of optimal solutions to constrained optimization problems with set-valued objective maps and we give some conditions under which these optimal solutions exist to the problems and give necessary and sufficient conditions for optimality.     

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

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

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.     

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.     

近似锥一次类凸集值向量优化问题强有效解的广义鞍点刻画

本文研究了近似锥一次类凸集值向量优化强有效解的广义鞍点表示问题.利用择一定理,得到了近似锥-次类凸集值优化问题强有效解为广义鞍点的充分条件和必要条件.所得结果丰富了集值优化理论,并且拓广了广义鞍点的应用.     

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

本文讨论集值映射向量优化问题的ε-真有效解。在集值映射为广义锥-次类凸的假设下,建立了这种解的标量化定理,ε-Lagrange乘子定理,ε-真鞍点定理和ε-真对偶性定理。     

ε-Optimality Conditions for Vector Optimization Problems with Set-Valued Maps

In this paper, I introduce two kinds of ε-subgradients—ε-Pareto subgradients and ε-Benson proper subgradients—for set-valued maps. I give sufficient conditions for the existence of such ε-subgradients. A generalized ε-Moreau–Rockafellar type theorem for ε-Benson proper subdifferentials of set-valued maps is formulated and applied to establish ε-optimality conditions for ε-Benson proper efficient solutions of vector optimization problems with set-valued maps. Scalarization theorems for such a problem are also obtained.     

On gap functions for nonsmooth multiobjective optimization problems

A set-valued gap function, \(\phi \), existing in the literature for smooth and nonsmooth multiobjective optimization problems is dealt with. It is known that \(0\in \phi (x^*)\) is a sufficient condition for efficiency of a feasible solution \(x^*\), while the converse does not hold. In the current work, the converse of this assertion is proved for properly efficient solutions. Afterwards, to avoid the complexities of set-valued maps some new single-valued gap functions, for nonsmooth multiobjective optimization problems with locally Lipschitz data are introduced. Important properties of the new gap functions are established.     

Some useful set-valued maps in set optimization

In this article, we introduce several classes of set-valued maps which can be useful in set optimization due to their applications. Exactly, we present some set-valued maps defined by scalar and vector functions and study their properties such as continuity and convexity among others. In addition, we compute their asymptotic maps which can be employed to establish coercivity and existence results in the framework of set optimization problems. Finally, we expose some possible directions for further research.     

向量优化中基于拟内部的弱C(\varepsilon)-有效解的标量化

首先获得了co-radiant集的一些拟内部性质. 进而在邻近C(\varepsilon)-次似凸性假设条件下, 建立了相应的择一性定理, 并给出了基于拟内部的集值向量优化问题弱C(\varepsilon)-有效解的线性标量化结果.     

On implicit function theorems for set-valued maps and their application to mathematical programming under inclusion constraints

In this paper we establish some implicit function theorems for a class of locally Lipschitz set-valued maps and then apply them to investigate some questions concerning the stability of optimization problems with inclusion constraints. In consequence we have an extension of some of the corresponding results of Robinson, Aubin, and others.     

The semi-<Emphasis Type="Italic">E</Emphasis> cone convex set-valued map and its applications

In this paper, firstly, a new notion of the semi-E cone convex set-valued map is introduced in locally convex spaces. Secondly, without any convexity assumption, we investigate the existence conditions of the weakly efficient element of the set-valued optimization problem. Finally, under the assumption of the semi-E cone convexity of set-valued maps, we obtain that the local weakly efficient element of the set-valued optimization problem is the weakly efficient element. We also give some examples to illustrate our results.     

Higher-order generalized Studniarski epiderivative and its applications in set-valued optimization

In the paper, we introduce the higher-order generalized Studniarski epiderivative of set-valued maps. Via this concept, some results on optimality conditions and duality for set-valued optimization problems are established.     

On Characterization of Solution Sets of Set-Valued Pseudoinvex Optimization Problems

In this paper, by using the scalarization method, we consider Stampacchia variational-like inequalities in terms of normal subdifferential for set-valued maps and study their relations with set-valued optimization problems. Furthermore, some characterizations of the solution sets of pseudoinvex extremum problems are given.