Necessary and Sufficient Conditions in Smooth Programming with Generalized Convexity

Hanson and Mond have grven sets of necessary and sufficient conditions for optimality in constrained optimization by introducing classes of generalized functions, called type Ⅰ functions. Recently, Bector definded univex functions, a new class of functions that unifies several concepts of generalized convexity. In this paper, additional conditions are attached to the Kuhn Tucker conditions giving a set of conditions which are both necessary and sufficient for optimality in constrained optimization, under appropriate constraint qualifications.

Optimality Conditions for Static Programming with Generalized Convexity

The definitions of generalized pseudoconvex,generalized quasiconvex and its stri ctly generalized convexity were presented for the static programming at locally star -shaped set using the concept of right-upper derivative and the concept of sub linear. The sufficient and necessary conditions of the static programming were d erived in terms of a generalized Lemma in this paper. The results obtained are u seful for the further study on the duality of static programming and cover many already known conditions.

Generalized Convexity and Generalized Quasi-variational Inequality

The properties of generalized convexity are studied in this paper,as well as an existence Theorem of solutions for a type of generalized quasi-variational inequality is then abtained.

The Optimality Conditions for Multiobjective Semi-infinite Programming Involving Generalized Unified （C, α, p, d）-convexity

The definition of generalized unified (C, α, ρ, d)-convex function is given. The concepts of generalized unified (C, α, ρ, d)-quasiconvexity, generalized unified (C, α, ρ, d)-pseudoconvexity and generalized unified (C, α, ρ, d)-strictly pseudoconvex functions are presented. The sufficient optimality conditions for multiobjective nonsmooth semi-infinite programming are obtained involving these generalized convexity lastly.

ON A GENERALIZED MODULUS OF CONVEXITY AND UNIFORM NORMAL STRUCTURE

In this article, the authors study a generalized modulus of convexity, δ（α） （ε）. Certain related geometrical properties of this modulus are analyzed. Their main result is that Banach space X has uniform normal structure if there exists ε, 0 ≤e≤ 1, such that δ^（α）（1＋ε ） 〉 （1- α）ε.

Optimality conditions and duality for a class of nondifferentiable multiobjective generalized fractional programming problems

This paper studies a class of multiobjective generalized fractional programming problems, where the numerators of objective functions are the sum of differentiable function and convex function, while the denominators are the difference of differentiable function and convex function. Under the assumption of Calmness Constraint Qualification the Kuhn-Tucker type necessary conditions for efficient solution are given, and the Kuhn-Tucker type sufficient conditions for efficient solution are presented under the assumptions of （F, α, ρ, d）-V-convexity. Subsequently, the optimality conditions for two kinds of duality models are formulated and duality theorems are proved.

Strongly Generalized Convex Fuzzy-Valued Function and Its Application in Fuzzy Optimization

Based on the ordering of fuzzy numbers proposed by Goetschel and Voxman,the representations and some properties of strongly preinvex fuzzy-valued function are defined and obtained, several new concepts of strongly monotonicities fuzzy functions are introduced, the relationship among the strongly preinvex, strongly invex and monotonicities under some suitable and appropriate conditions is established and a necessary condition for strongly pseudoinvex functions is given. As an application, the conditions of local optimal solution and global optimal solution in the mathematical programming problem are discussed.

QUASI-EQUILIBRIUM PROBLEMS AND CONSTRAINED MULTIOBJECTIVE GAMES IN GENERALIZED CONVEX SPACE

A class of quasi-equilibrium problems and a class of constrained multiobjective games were introduced and studied in generalized convex spaces without linear structure. First, two existence theorems of solutions for quasi-equilibrium problems are proved in noncompact generalized convex spaces. Then, ar applications of the quasi-equilibrium existence theorem, several existence theorems of weighted Nash-equilibria and Pareto equilibria for the constrained multiobjective games are established in noncompact generalized convex spaces. These theorems improve, unify, and generalize the corresponding results of the multiobjective games in recent literatures.

QUASI_EQUILIBRIUM PROBLEMS IN NONCOMPACT GENERALIZED CONVEX SPACES

By applying a new fixed point theorem due to the author, some new equilibrium existence theorems of quasi-equilibrium problems are proved in noncompact generalized convex spaces. These theorems improve and generalize a number of important known results in recent literature.

Fan-Browder Type Fixed Point Theorems and Its Applications on Generalized Convex Product Spaces

Fan-Browder type fixed point theorems are obtained for non-selfmaps on non-compact generalized convex product spaces and new existence problems of（partially） maximai element and equilibrium point are discussed as applications of above results.

NONCOMPACT INFINITE OPTIMIZATION AND EQUILIBRIA OF CONSTRAINED GAMES IN GENERALIZED CONVEX SPACES

By applying a new existence theorem of quasi-equilibrium problems due to the author, some existence theorems of solutions for noncompact infinite optimization problems and noncompact constrained game problems are proved in generalized convex spaces without linear structure. These theorems improve and generalize a number of important results in recent literature.

ANOTHER FORM OF KKM TYPE THEOREM AND ITS APPLICATIONS ON GENERALIZED CONVEX SPACES

In this paper, another form of KKM type theorem on generalized convex spaces is obtained and the problems of von Neumann-Fan type sup inf sup inequalities and variational inequalities are discussed for their applications.The main results improve and generalize the corresponding results in previous papers.

Coincidence Points and Almost-like Coincidence Points on Generalized ConvexSpaces with Applications

We introduce the concept of a weakly G-quasiconvex map with respect to a map on generalized convex spaces and use the concept to prove coincidence point theorems and almost-like coincidence point theorems. As applications of the above results, we derive almost fixed point theorems and fixed point theorem. These main results generalize and improve some known results in the literature.

Existence results for generalized vector equilibrium problems with applications

By a coincidence theorem, some existence theorems of solutions are proved for four types of generalized vector equilibrium problems with moving cones. Applications to the generalized semi-infinite programs with the generalized vector equilibrium constraints under the mild conditions are also given. The results of this paper unify and improve the corresponding results in the previous literature.

Optimality Conditions and Duality for Nondifferentiable Multiobjective Semi-Infinite Programming Problems with Generalized(C,α,ρ,d)-Convexity

This paper obtains sufficient optimality conditions for a nonlinear nondifferentiable multiobjective semi-infinite programming problem involving generalized(C,α,ρ,d)-convex functions.The authors formulate Mond-Weir-type dual model for the nonlinear nondifferentiable multiobjective semiinfinite programming problem and establish weak,strong and strict converse duality theorems relating the primal and the dual problems.

Constrained Dynamic Game and Symmetric Duality for Variational Problems

A certain constrained dynamic game is shown to be equivalent to a pair of symmetric dual variational problems which have more general formulation than those already existing in the literature. Various duality results are proved under convexity and generalized convexity assumptions on the appropriate functionals. The dynamic game is also viewed as equivalent to a pair of dual variational problems without the condition of fixed points. It is also indicated that the equivalent formulation of a pair of symmetric dual variational problems as dynamic generalization of those had been already studied in the literature. In essence, the purpose of the research is to establish that the solution of variational problems yields the solution of the dynamic game.

NEW COLLECTIVELY FIXED POINT THEOREMS AND APPLICATIONS IN G-CONVEX SPACES

By applying the technique of continuous partition of unity and Tychonoff's fixed point theorem,. some new collectively fixed point theorems for a family of set-valued, mappings defined on the product space of noncompact G-convex spaces are proved. As applications, some nonempty intersetion theorems of Ky Fan type for a family of subsets of the product space of G convex spaces are proved; An existence theorem of solutions for a system of nonlinear inequalities is given in G-convex spaces and some equilibrium existence of abstract economies are also obtained in G convex spaces. Our theorems theorems of improve, unify and generalized many important known results in recent literature.

Optimality Conditions for Generalized Convex Nonsmooth Uncertain Multi-objective Fractional Programming

This paper aims at studying optimality conditions of robust weak efficient solutions for a nonsmooth uncertain multi-objective fractional programming problem(NUMFP).The concepts of two types of generalized convex function pairs,called type-I functions and pseudo-quasi-type-I functions,are introduced in this paper for(NUMFP).Under the assumption that(NUMFP)satisfies the robust constraint qualification with respect to Clarke subdifferential,necessary optimality conditions of the robust weak efficient solution are given.Sufficient optimality conditions are obtained under pseudo-quasi-type-I generalized convexity assumption.Furthermore,we introduce the concept of robust weak saddle points to(NUMFP),and prove two theorems about robust weak saddle points.The main results in the present paper are verified by concrete examples.

HIGHER-ORDER DUALITY FOR A CLASS OF NONDIFFERENTIABLE MULTIOBJECTIVE PROGRAMMING PROBLEMS INVOLVING GENERALIZED TYPE I AND RELATED FUNCTIONS

This paper extends the class of generalized type I functions introduced by Aghezzaf and Hachimi（2000） to the context of higher-order case and formulate a number of higher-order duals to a non-differentiable multi-objective programming problem and establishes higher-order duality results under the higher-order generalized type I functions introduced in the present paper, A special case that appears repeatedly in the literature is that the support function is the square root of a positive semi-definite quadratic form. This and other special cases can be readily generated from these results.

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.