Optimality and Duality for A Class of Non-Smooth Generalized B-vex Programming

1.IntroductionItiswellknownthatconvexityplayanimportantroleinestablishingthesufficientoptimalityconditionsanddualitytheoremsforanonlinearprogrammingproblem.Severalclassoffunctionshavebeendefinedforthepurposeofweakeningthelimitationsofconvexity.Recent...     

Generalization of preinvex and B-vex functions

A class of functions called B-preinvex functions is introduced by relaxing the definitions of preinvex and B-vex functions. Examples are given to show that there exist functions which are B-preinvex but not preinvex or B-vex or quasipreinvex. Some of the properties of B-preinvex functions are obtained.The contribution of this author was made partially at University of Manitoba and partially at St. Lawrence University during the summer of 1990. Support for the visit to St. Lawrence University was made possible under the GTE/SLU Visiting Scholars Grant.     

Generalized convex functions and generalized differentials

We study some classes of generalized convex functions, using a generalized differential approach. By this we mean a set-valued mapping which stands either for a derivative, a subdifferential or a pseudo-differential in the sense of Jeyakumar and Luc. Such a general framework allows us to avoid technical assumptions related to specific constructions. We establish some links between the corresponding classes of pseudoconvex, quasiconvex and another class of generalized convex functions we introduced. We devise some optimality conditions for constrained optimization problems. In particular, we get Lagrange–Kuhn–Tucker multipliers for mathematical programming problems.     

Generalized Convexity of Functions and Generalized Monotonicity of Set-Valued Maps

We establish connections between some concepts of generalized monotonicity for set-valued maps introduced earlier and some notions of generalized convexity. Moreover, a notion of pseudomonotonicity for set-valued maps is introduced; it is shown that, if a function f is continuous, then its pseudoconvexity is equivalent to the pseudomonotonicity of its generalized subdifferential in the sense of Clarke and Rockafellar.     

广义B-凸模糊映射及其应用

提出B-E-凸模糊映射的概念,并讨论了其一些性质,得到了这一类广义B-凸模糊映射的若干刻划定理,还讨论了这一类广义B-凸模糊映射在模糊优化中的应用,并得到了和最优解有关的一些结果。     

具有广义B-凸函数的非光滑多目标规划的最优性与向量Lagrange鞍点理论

利用广义B-凸函数等概念，讨论了一类非光滑多目标规划，给出了广义最优性充分条件和Mond-Weir型对偶结果，讨论了向量Lagrange乘子性质并证明了向量值鞍点定理。     

Generalization of preinvex and B-vex fuzzy mappings

A class of fuzzy mappings, called B-preinvex, and strictly B-preinvex fuzzy mappings, is introduced by relaxing the definition of preinvexity of a fuzzy mapping. Similarly, based on a notion of differentiability of fuzzy mappings different from the usual one, the class of pseudo-B-vex, B-invex, and pseudo-B-invex fuzzy mappings is defined as a generalization of pseudo-convex, invex, and pseudo-invex fuzzy mappings. We prove that a strictly B-vex, or B-preinvex fuzzy mapping has at most one global minimum point, and that the class of B-vex fuzzy mappings forms a subset of the class of quasi-convex fuzzy mappings. B-vex (resp. B-preinvex) fuzzy mappings satisfy most of the basic properties of convex (resp. preinvex) fuzzy mappings. In addition characterizations and sufficient optimality conditions are obtained for B-vex and B-preinvex fuzzy mappings.     

On convergence properties of a least-distance programming procedure for minimization problems under linear constraints

In Ref. 1, Bazaraa and Goode provided an algorithm for solving a nonlinear programming problem with linear constraints. In this paper, we show that this algorithm possesses good convergence properties.This paper was written under the guidance of Associate Professor C. Y. Wang. The author takes great pleasure in thanking him.     

Lipschitz B-Vex Functions and Nonsmooth Programming

In this paper, the equivalence between the class of B-vex functions and that of quasiconvex functions is proved. Necessary and sufficient conditions, under which a locally Lipschitz function is B-vex, are established in terms of the Clarke subdifferential. Regularity of locally Lipschitz B-vex functions is discussed. Furthermore, under appropriate conditions, a necessary optimality condition of the Slater type and a sufficient optimality condition are obtained for a nonsmooth programming problem involving B-vex functions.     

Three kinds of generalized convexity

This paper gives some properties of quasiconvex, strictly quasiconvex, and strongly quasiconvex functions. Relationships between them are discussed.This research was supported in part by the National Natural Science Foundation of China. The author would like to thank Professor M. Avriel for valuable comments about this paper.