THE OPTIMALITY CONDITIONS OF NONCONVEXSET-VALUED VECTOR OPTIMIZATION

The concepts of alpha-order Clarke's derivative, alpha-order Adjacent derivative and alpha-order G.Bouligand derivative of set-valued mappings are introduced, their properties are studied, with which the Fritz John optimality condition of set-valued vector optimization is established. Finally, under the assumption of pseudoconvexity, the optimality condition is proved to be sufficient.

Monotone Set-Valued Function Defined by Set-Valued Choquet Integral

Structural characteristics and absolute continuities of monotone set-valued function defined by set- valued Choquet integral are discussed. Similar to the single-valued monotone set function, several important structural characteristics of set-valued function are defined and have been proven the same as those in the original set functions, such as null-additivity, weakly null-additivity, order continuity, strong order continuity and property（S）. A counterexample shows that order continuity and strong order continuity of the original set functions are no longer kept in a monotone set-valued function when Choquet integrably bounded assumption is abandoned. Four kinds of absolute continuities are defined for set-valued function, and all been proven valid with respect to the original set functions.

CONE-DIRECTED CONTINGENT DERIVATIVES AND GENERALIZED PREINVEX SET-VALUED OPTIMIZATION

By using cone-directed contingent derivatives, the unified necessary and sufficient optimality conditions are given for weakly and strongly minimal elements respectively in generalized preinvex set-valued optimization.

EKELAND'S PRINCIPLE FOR SET-VALUED VECTOR EQUILIBRIUM PROBLEMS

In this paper, we introduce a concept of quasi C-lower semicontinuity for setvalued mapping and provide a vector version of Ekeland＇s theorem related to set-valued vector equilibrium problems. As applications, we derive an existence theorem of weakly efficient solution for set-valued vector equilibrium problems without the assumption of convexity of the constraint set and the assumptions of convexity and monotonicity of the set-valued mapping. We also obtain an existence theorem of ε-approximate solution for set-valued vector equilibrium problems without the assumptions of compactness and convexity of the constraint set.

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.

ON THE GENERALIZED FRITZ JOHN OPTIMALITY CONDITIONS OF VECTOR OPTIMIZATION WITH SET-VALUED MAPS UNDER BENSON PROPER EFFICIENCY

A kind of tangent derivative and the concepts of strong and weak * pseudoconvexity for a set-valued map are introduced. By the standard separation theorems of the convex sets and cones the optimality Fritz John condition of set-valued optimization under Benson proper efficiency is established, its sufficience is discussed. The form of the optimality conditions obtained here completely tally with the classical results when the set-valued map is specialized to be a single-valued map.

KUHN-TUCKER CONDITION AND WOLFE DUALITY OF PREINVEX SET-VALUED OPTIMIZATION

The optimality Kuhn-Tucker condition and the wolfe duality for the preinvex set-valued optimization are investigated. Firstly, the concepts of alpha-order G-invex set and the alpha-order S-preinvex set-valued function were introduced, from which the properties of the corresponding contingent cone and the alpha-order contingent derivative were studied. Finally, the optimality Kuhn-Tucker condition and the Wolfe duality theorem for the alpha-order S-preinvex set-valued optimization were presented with the help of the alpha-order contingent derivative.

Benson proper efficiency for vector optimization of generalized subconvexlike set-valued maps in ordered linear spaces

Several equivalent statements of generalized subconvexlike set-valued map are established in ordered linear spaces. Using vector closure, we introduce Benson proper efficient solution of vector optimization problem. Under the assumption of generalized subconvexlikeness, scalarization, multiplier and saddle point theorems are obtained in the sense of Benson proper efficiency.

Auxiliary principle and three-step iterative algorithms for generalized set-valued strongly nonlinear mixed variational-like inequalities

An auxiliary principle technique to study a class of generalized set-valued strongly nonlinear mixed variational-like inequalities is extended. The existence and uniqueness of the solution of the auxiliary problem for the generalized set-valued strongly nonlinear mixed variational-like inequalities are proved, a novel and innovative three-step iterative algorithm to compute approximate solution is constructed, and the existence of the solution of the generalized set-valued strongly nonlinear mixed variational-like inequality is shown using the auxiliary principle iterative sequences generated by the algorithm technique. The convergence of three-step is also proved.

Some Dynamical Properties in Set-valued Discrete Systems

1 Introduction A discrete dynamical system can be expressed as xn+1 ?f(xn), n = 0,1,2,... where X is a metric space and f : X →X is a continuous map. The study of it tells us how the points in the base space X moved. Nevertheless, this is not enough for the researches of biological species, demography, numerical simulation and attractors (see [1], [2]). It is necessary to know how the subsets of X moved. In this direction, we consider the set-valued discrete system associated to f, An+1 = (f|-)(An), n = 0,1,2,... where (f|-) is the natural extension of f to K(X) (the class of all compact subsets of X).

ε-super Effcient Solutions of Optimization Problems with Set-valued Maps in Locally Convex Space

In this paper,the ε-super effcient solution for set-valued map vector optimization in locally convex space is introduced.And under the assumption of the nearly generalized cone-subconvexlikeness for set-valued maps,used new methods,the scalarization theorem and Lagrange multiplier theorem for ε-super effcient solution are established.

ANALYSIS OF SYSTEM QUALITY BY SET-VALUED STATISTICS

ＡＮＡＬＹＳＩＳＯＦＳＹＳＴＥＭＱＵＡＬＩＴＹＢＹＳＥＴ┐ＶＡＬＵＥＤＳＴＡＴＩＳＴＩＣＳ＊ＨｕａｎｇＨｏｎｇｚｈｏｎｇ（黄洪钟）ＨｕＺｏｎｇｗｕ（胡宗武）（Ｄｅｐｔ．ｏｆＭｅｃｈａｎｉｃａｌＥｎｇｉｎｅｅｒｉｎｇ，ＳｈａｎｇｈａｉＪｉａｏｔｏｎｇＵ...

Sensitivity analysis of generalized set-valued quasi-variational inclusion in Banach spaces

The sensitivity analysis for a class of generalized set-valued quasi-variational inclusion problems is investigated in the setting of Banach spaces. By using the resolvent operator technique, without assuming the differentiability and monotonicity of the given data, equivalence of these problems to the class of generalized resolvent equations is established.

ON SELECTIONS OF SET-VALUED EULER-LAGRANGE INCLUSIONS WITH APPLICATIONS

We discuss the set-valued dynamics related to the theory of functional equations.We look for selections of convex set-valued functions satisfying set-valued Euler-Lagrange inclusions.We improve and extend upon some of the results in[13,20],but under weaker assumptions.Some applications of our results are also provided.

System of set-valued mixed quasi-variational-like inclusions involving H-η-monotone operators in Banach spaces

A new system of the set-valued mixed quasi-variational-like inclusions （SSMQVLI） involving H-η-monotone operators is studied in general Banach spaces without uniform smoothness. By using the resolvent operator technique of H-η-monotone operators, a new iterative algorithm for finding approximate solutions to SSMQVLI is proposed. It is shown that the iterative sequences generated by the algorithm converge strongly to the exact solution of SSMQVLI under appropriate assumptions. These obtained new results have extended and improved previous results.

CONTINUOUS SELECTIONS OF THE SET-VALUED METRIC GENERALIZED INVERSE IN 2-STRICTLY CONVEX BANACH SPACES

In this paper,we prove that if X is an almost convex and 2-strictly convex space,linear operator T:X→Y is bounded,N(T)is an approximative compact Chebyshev subspace of X and R(T)is a 3-Chebyshev hyperplane,then there exists a homogeneous selection T^(σ)of T^(■)such that continuous points of T^(σ)and T^(■)are dense on Y.

Projected subgradient method for non-Lipschitz set-valued mixed variational inequalities

A projected subgradient method for solving a class of set-valued mixed variational inequalities （SMVIs） is proposed when the mapping is not necessarily Lipschitz. Under some suitable conditions, it can be proven that the sequence generated by the method can strongly converge to the unique solution to the problem in the Hilbert spaces.

SET-VALUED CARISTI’S FIXED POINT THEOREM AND EEELAND’S VARIATIONAL PRINCIPLE

This paper proposes a formally stronger set-valued Caristi’s fixed point theorem and by using a simple method we give a direct proof for the equivalence between Ekeland’s variational principle and this set-valued Caristi’s fixed point theorem.The results stated in this paper improve and strengthen the corresponding results in[4].

Attribute Reduction in Interval and Set-Valued Decision Information Systems

In many practical situation, some of the attribute values for an object may be interval and set-valued. This paper introduces the interval and set-valued information systems and decision systems. According to the semantic relation of attribute values, interval and set-valued information systems can be classified into two categories: disjunctive (Type 1) and conjunctive (Type 2) systems. In this paper, we mainly focus on semantic interpretation of Type 1. Then, we define a new fuzzy preference relation and construct a fuzzy rough set model for interval and set-valued information systems. Moreover, based on the new fuzzy preference relation, the concepts of the significance measure of condition attributes and the relative significance measure of condition attributes are given in interval and set-valued decision information systems by the introduction of fuzzy positive region and the dependency degree. And on this basis, a heuristic algorithm for calculating fuzzy positive region reduction in interval and set-valued decision information systems is given. Finally, we give an illustrative example to substantiate the theoretical arguments. The results will help us to gain much more insights into the meaning of fuzzy rough set theory. Furthermore, it has provided a new perspective to study the attribute reduction problem in decision systems.

Optimality for Henig Proper Efficiency in Vector Optimization Involving Dini Set-Valued Directional Derivatives

This note studies the optimality conditions of vector optimization problems involving generalized convexity in locally convex spaces. Based upon the concept of Dini set-valued directional derivatives, the necessary and sufficient optimality conditions are established for Henig proper and strong minimal solutions respectively in generalized preinvex vector optimization problems.