For both differentiable and nondifferentiable functions defined in abstract spaces we characterize the generalized convex property, here called cone-invexity, in terms of Lagrange multipliers. Several classes of such functions are given. In addition an extended Kuhn-Tucker type optimality condition and a duality result are obtained for quasidifferentiable programming problems. 1980 Mathematics subject classification (Amer. Math. Soc): 90 C 30. 1
textabstractIn this paper we will show that the closely K-convexlike vector-valued functions with K ...
In this paper, we introduce new types of generalized convex functions which include locally (Hp, r)-...
In this paper, we modified a Courant-Beltrami penalty function method for constrained optimization p...
AbstractThe concept of invexity has allowed the convexity requirements in a variety of mathematical ...
AbstractIn this paper, generalizing the concept of cone convexity, we have defined cone preinvexity ...
AbstractIn this study we present an important theorem of the alternative involving convex functions ...
In this paper, we are concerned with a nondifferentiable multiobjective programming problem with ine...
AbstractIn this paper, a generalization of convexity, called d-invexity, is introduced. Substituting...
The book presents an overview (and also some new results) on invex and related functions in various...
In this paper, a generalization of convexity is considered in the case of multiobjective optimizatio...
In this paper, a generalization of convexity is considered in the case of multiobjective optimizatio...
A method of solving problems involving invex functions via certain convex problems is presented. Non...
AbstractIt is pointed out that Type 1 invex functions are the most general class of functions releva...
The concept of -convex function and its generalizations is studied with differentiability assumption...
summary:The relation between the general optimality conditions in terms of contact cones and the Kuh...
textabstractIn this paper we will show that the closely K-convexlike vector-valued functions with K ...
In this paper, we introduce new types of generalized convex functions which include locally (Hp, r)-...
In this paper, we modified a Courant-Beltrami penalty function method for constrained optimization p...
AbstractThe concept of invexity has allowed the convexity requirements in a variety of mathematical ...
AbstractIn this paper, generalizing the concept of cone convexity, we have defined cone preinvexity ...
AbstractIn this study we present an important theorem of the alternative involving convex functions ...
In this paper, we are concerned with a nondifferentiable multiobjective programming problem with ine...
AbstractIn this paper, a generalization of convexity, called d-invexity, is introduced. Substituting...
The book presents an overview (and also some new results) on invex and related functions in various...
In this paper, a generalization of convexity is considered in the case of multiobjective optimizatio...
In this paper, a generalization of convexity is considered in the case of multiobjective optimizatio...
A method of solving problems involving invex functions via certain convex problems is presented. Non...
AbstractIt is pointed out that Type 1 invex functions are the most general class of functions releva...
The concept of -convex function and its generalizations is studied with differentiability assumption...
summary:The relation between the general optimality conditions in terms of contact cones and the Kuh...
textabstractIn this paper we will show that the closely K-convexlike vector-valued functions with K ...
In this paper, we introduce new types of generalized convex functions which include locally (Hp, r)-...
In this paper, we modified a Courant-Beltrami penalty function method for constrained optimization p...