On super efficiency in set-valued optimization

The set-valued optimization problem with constraints is considered in the sense of super efficiency in locally convex linear topological spaces. Under the assumption of iccone-convexlikeness, by applying the seperation theorem, Kuhn-Tucker＇s, Lagrange＇s and saddle points optimality conditions, the necessary conditions are obtained for the set-valued optimization problem to attain its super efficient solutions. Also, the sufficient conditions for Kuhn-Tucker＇s, Lagrange＇s and saddle points optimality conditions are derived.     

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

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

Super efficiency in convex vector optimization

We establish a Lagrange Multiplier Theorem for super efficiency in convex vector optimization and express super efficient solutions as saddle points of appropriate Lagrangian functions. An example is given to show that the boundedness of the base of the ordering cone is essential for the existence of super efficient points.Research is supported partially by NSERC.Research is supported partially by NSERC and Mount St. Vincent University grant.     

几乎锥-次类凸向量集值优化的Benson真有效性

§ 1　ＩｎｔｒｏｄｕｃｔｉｏｎＩｎ [1 ],Ｙａｎｇ ,ＬｉａｎｄＷａｎｇｉｎｔｒｏｄｕｃｅｄａｎｅｗｃｌａｓｓｏｆｇｅｎｅｒａｌｉｚｅｄｃｏｎｖｅｘｓｅｔ ｖａｌｕｅｄｆｕｎｃ ｔｉｏｎｓ,ｔｅｒｍｅｄｎｅａｒｌｙｃｏｎｅ ｓｕｂｃｏｎｖｅｘｌｉｋｅｆｕｎｃｔｉｏｎｓ.Ｉｎ [2 ],ＣｈｅｎａｎｄＲｏｎｇｓｔｕｄｉｅｄＢｅｎｓｏｎｐｒｏｐｅｒｅｆｆｉｃｉｅｎｃｙｉｎｖｅｃｔｏｒｏｐｔｉｍｉｚａｔｉｏｎｗｉｔｈｇｅｎｅｒａｌｉｚｅｄｃｏｎｅ ｓｕｂｃｏｎｖｅｘｌｉｋｅｖｅｃｔｏｒ ｖａｌｕｅｄｆｕｎｃ ｔｉｏｎｓ…     

Globally proper saddle point in ic-cone-convexlike set-valued optimization problems

The existence conditions of globally proper efficient points and a useful property of ic- cone-convexlike set-valued maps are obtained. Under the assumption of the ic-cone-convexlikeness, the optimality conditions for globally proper efficient solutions are established in terms of Lagrange multipliers. The new concept of globally proper saddle-point for an appropriate set-valued Lagrange map is introduced and used to characterize the globally proper efficient solutions. The results which are obtained in this paper are proven under the conditions that the ordering cone need not to have a nonempty interior.     

Generalizations of vector quasivariational inclusion problems with set-valued maps

Existence theorems are given for the problem of finding a point (z ₀,x ₀) of a set E × K such that and, for all where α is a relation on 2 ^Y (i.e., a subset of 2 ^Y  × 2 ^Y ), and are some set-valued maps, and Y is a topological vector space. Detailed discussions are devoted to special cases of α and C which correspond to several generalized vector quasi-equilibrium problems with set-valued maps. In such special cases, existence theorems are obtained with or without pseudomonotonicity assumptions.     

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.     

Loose saddle points of set-valued maps in topological vector spaces

We give a new existence theorem for loose saddle point of set-valued map having values in a partially ordered topological vector space which is based on continuity and quasiconvexity- quasiconcavity of its scalarized maps. Moreover, we prove a new saddle point theorem for vector-valued functions in locally convex topological vector spaces under weak condition that is the semicontinuity of two function scalarization.     

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

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

Optimality conditions for weak and firm efficiency in set-valued optimization

This paper concerns the study of weak and firm local efficiency in constrained mathematical problems governed by set-valued mappings. We derive optimality conditions by means of the Bouligand derivative and by means of the Mordukhovich coderivative as well.     

Optimality conditions for set-valued maps with set optimization

Problems in set-valued optimization can be solved via set optimization. In this paper optimality conditions are studied for set-valued maps with set optimization. Optimality requirements are established for continuous selections using directional derivatives. Necessary and sufficient conditions for the existence of solutions are shown for set-valued maps under generalized convexity assumptions and with the notion of the contingent derivative.     

Nonconvex scalarization in set optimization with set-valued maps

The aim of this work is to obtain scalar representations of set-valued optimization problems without any convexity assumption. Using a criterion of solution introduced by Kuroiwa [D. Kuroiwa, Some duality theorems of set-valued optimization with natural criteria, in: Proceedings of the International Conference on Nonlinear Analysis and Convex Analysis, World Scientific, River Edge, NJ, 1999, pp. 221-228], which is based on ordered relations between sets, we characterize this type of solutions by means of nonlinear scalarization. The scalarizing function is a generalization of the Gerstewitz's nonconvex separation function. As applications of our results we give two existence theorems for set-valued optimization problems.     

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.     

Conjugate dual problems in constrained set-valued optimization and applications

In this paper, two conjugate dual problems are proposed by considering the different perturbations to a set-valued vector optimization problem with explicit constraints. The weak duality, inclusion relations between the image sets of dual problems, strong duality and stability criteria are investigated. Some applications to so-called variational principles for a generalized vector equilibrium problem are shown.     

集值映射多目标半定规划问题的epsilon-弱有效性

对于集值映射多目标半定规划问题, 在近似锥-次类凸的框架下, 建立了含矩阵和向量的择一性定理, 给出了问题的epsilon-弱有效解的epsilon-Lagrange乘子定理及标量化定理和epsilon-弱鞍点定理．     

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.     

A generic approach to approximate efficiency and applications to vector optimization with set-valued maps

In this paper we focus on approximate minimal points of a set in Hausdorff locally convex spaces. Our aim is to develop a general framework from which it is possible to deduce important properties of these points by applying simple results. For this purpose we introduce a new concept of ε-efficient point based on set-valued mappings and we obtain existence results and properties on the behavior of these approximate efficient points when ε is fixed and by considering that ε tends to zero. Finally, the obtained results are applied to vector optimization problems with set-valued mappings.