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.     

Characterizations of improvement sets via quasi interior and applications in vector optimization

In this paper, we first give some characterizations of improvement sets via quasi interior. Furthermore, as applications of these characterizations, we establish an alternative theorem via improvement sets and quasi interior, and then obtain a scalarization result of weak \(E\)-efficient solutions defined by improvement sets and quasi interior for vector optimization problems with set-valued maps. Moreover, we also present some examples to illustrate the main conditions and results.     

Characterizations of set order relations and constrained set optimization problems via oriented distance function

Set-valued optimization problems are important and fascinating field of optimization theory and widely applied to image processing, viability theory, optimal control and mathematical economics. There are two types of criteria of solutions for the set-valued optimization problems: the vector criterion and the set criterion. In this paper, we adopt the set criterion to study the optimality conditions of constrained set-valued optimization problems. We first present some characterizations of various set order relations using the classical oriented distance function without involving the nonempty interior assumption on the ordered cones. Then using the characterizations of set order relations, necessary and sufficient conditions are derived for four types of optimal solutions of constrained set optimization problem with respect to the set order relations. Finally, the image space analysis is employed to study the c-optimal solution of constrained set optimization problems, and then optimality conditions and an alternative result for the constrained set optimization problem are established by the classical oriented distance function.     

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

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

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

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

The Karush–Kuhn–Tucker optimality conditions in multiobjective programming problems with interval-valued objective functions

The KKT conditions in multiobjective programming problems with interval-valued objective functions are derived in this paper. Many concepts of Pareto optimal solutions are proposed by considering two orderings on the class of all closed intervals. In order to consider the differentiation of an interval-valued function, we invoke the Hausdorff metric to define the distance between two closed intervals and the Hukuhara difference to define the difference of two closed intervals. Under these settings, we are able to consider the continuity and differentiability of an interval-valued function. The KKT optimality conditions can then be naturally elicited.     

Fuzzy linear programming problems as bi-criteria optimization problems

In this paper, we consider fuzzy linear programming (FLP) problems which involve fuzzy numbers only in coefficients of objective function. First, we shall give concepts of optimal solutions to (FLP) problems and investigate their properties. Next, in order to find all optimal solutions, we define three types of bi-criteria optimization problems.     

Efficiency in vector quasi-equilibrium problems and applications

In this paper, we give sufficient conditions for the existence of efficient solutions of a generalized vector quasi-equilibrium problem in topological vector spaces. The motivations for introducing this problem come from practical problems in traffic networks and the optimal control theory for discrete-time dynamical systems. The main results of the paper are proven with the help of a strongly monotonic function which can be constructed from the data of the problem under consideration. Some notions of cone-semicontinuity of set-valued maps, weaker than the usual concepts of semicontinuity, are also used in our study. As applications, we obtain existence results in vector quasi-optimization problems, Stampacchia set-valued vector quasi-variational inequality problems and Pareto vector quasi-saddle point problems. All these results are different from the corresponding ones in the literature.     

Methods of variational analysis in multiobjective optimization

This article studies new applications of advanced methods of variational analysis and generalized differentiation to constrained problems of multiobjective/vector optimization. We pay most attention to general notions of optimal solutions for multiobjective problems that are induced by geometric concepts of extremality in variational analysis, while covering various notions of Pareto and other types of optimality/efficiency conventional in multiobjective optimization. Based on the extremal principles in variational analysis and on appropriate tools of generalized differentiation with well-developed calculus rules, we derive necessary optimality conditions for broad classes of constrained multiobjective problems in the framework of infinite-dimensional spaces. Applications of variational techniques in infinite dimensions require certain ‘normal compactness’ properties of sets and set-valued mappings, which play a crucial role in deriving the main results of this article.     

On Quantitative Stability in Optimization and Optimal Control

We study two continuity concepts for set-valued maps that play central roles in quantitative stability analysis of optimization problems: Aubin continuity and Lipschitzian localization. We show that various inverse function theorems involving these concepts can be deduced from a single general result on existence of solutions to an inclusion in metric spaces. As applications, we analyze the stability with respect to canonical perturbations of a mathematical program in a Hilbert space and an optimal control problem with inequality control constraints. For stationary points of these problems, Aubin continuity and Lipschitzian localization coincide; moreover, both properties are equivalent to surjectivity of the map of the gradients of the active constraints combined with a strong second-order sufficient optimality condition.     

ε-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.     

Coderivative necessary optimality conditions for sharp and robust efficiencies in vector optimization with variable ordering structure

In this paper, we define two new concepts of efficiency for vector optimization with variable ordering structure, namely the sharp and robust efficiencies, and we study their connections with classical concepts of efficiency in vector optimization. Then, we get necessary optimality conditions for them using Fréchet and Mordukhovich calculus coupled with the Gerstewitz’s (Tammer’s) scalarizing functional and openness results for set-valued maps.     

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

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

Calculus of tangent sets and derivatives of set-valued maps under metric subregularity conditions

In this paper we give some calculus rules for tangent sets in the sense of Bouligand and Ursescu, as well as for corresponding derivatives of set-valued maps. Both first and second-order objects are envisaged and the assumptions we impose in order to get the calculus are in terms of metric subregularity of the assembly of the initial data. This approach is different from those used in alternative recent papers in literature and allows us to avoid compactness conditions. An application to a special type of vector optimization problems, where the objective is given as the sum of two multifunctions, is presented. Furthermore, also as application, a special attention is paid for the case of perturbation set-valued maps which naturally appear in optimization problems.     

Optimality conditions for various efficient solutions involving coderivatives: From set-valued optimization problems to set-valued equilibrium problems

We present a new approach to the study of a set-valued equilibrium problem (for short, SEP) through the study of a set-valued optimization problem with a geometric constraint (for short, SOP) based on an equivalence between solutions of these problems. As illustrations, we adapt to SEP enhanced notions of relative Pareto efficient solutions introduced in set optimization by Bao and Mordukhovich and derive from known or new optimality conditions for various efficient solutions of SOP similar results for solutions of SEP as well as for solutions of a vector equilibrium problem and a vector variational inequality.We also introduce the concept of quasi weakly efficient solutions for the above problems and divide all efficient solutions under consideration into the Pareto-type group containing Pareto efficient, primary relative efficient, intrinsic relative efficient, quasi relative efficient solutions and the weak Pareto-type group containing quasi weakly efficient, weakly efficient, strongly efficient, positive properly efficient, Henig global properly efficient, Henig properly efficient, super efficient and Benson properly efficient solutions. The necessary conditions for Pareto-type efficient solutions and necessary/sufficient conditions for weak Pareto-type efficient solutions formulated here are expressed in terms of the Ioffe approximate coderivative and normal cone in the Banach space setting and in terms of the Mordukhovich coderivative and normal cone in the Asplund space setting.     

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

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

集值优化问题Benson真有效解的高阶Fritz John型最优性条件

本文讨论的是集值优化问题Benson真有效解的高阶Fritz John型最优性条件,利用Aubin和Fraukowska引入的高阶切集和凸集分离定理,在锥-似凸映射的假设条件下,获得了带广义不等式约束的集值优化问题Benson真有效解的高阶Fritz John型必要和充分性条件.     

Higher order optimality conditions for Henig efficient solutions in set-valued optimization

In this paper, higher order generalized contingent epiderivative and higher order generalized adjacent epiderivative of set-valued maps are introduced. Necessary and sufficient conditions for Henig efficient solutions to a constrained set-valued optimization problem are given by employing the higher order generalized epiderivatives.     

The Karush–Kuhn–Tucker optimality conditions in an optimization problem with interval-valued objective function

The KKT conditions in an optimization problem with interval-valued objective function are derived in this paper. Two solution concepts of this optimization problem are proposed by considering two partial orderings on the set of all closed intervals. In order to consider the differentiation of an interval-valued function, we invoke the Hausdorff metric to define the distance between two closed intervals and the Hukuhara difference to define the difference of two closed intervals. Under these settings, we derive the KKT optimality conditions.