In this paper, using Clarke’s generalized directional derivative and dI-invexity we introduce new concepts of nonsmooth K-α-dI-invex and generalized type I univex functions over cones for a nonsmooth vector optimization problem with cone constraints. We obtain some sufficient optimality conditions and Mond-Weir type duality results under the foresaid generalized invexity and type I cone-univexi...

in this paper, using clarke’s generalized directional derivative and di-invexity we introduce new concepts of nonsmooth k-α-di-invex and generalized type i univex functions over cones for a nonsmooth vector optimization problem with cone constraints. we obtain some sufficient optimality conditions and mond-weir type duality results under the foresaid generalized invexity and type i cone-univexi...

Abstract. In this paper a generalization of invexity is considered in a general form, by means of the concept of K-directional derivative. Then in the case of nonlinear multiobjective programming problems where the functions involved are nondifferentiable, we established sufficient optimality conditions without any convexity assumption of the K-directional derivative. Then we obtained some dual...

First order characterizations of pseudoconvex functions are investigated in terms of generalized directional derivatives. A connection with the invexity is analysed. Well-known first order characterizations of the solution sets of pseudolinear programs are generalized to the case of pseudoconvex programs. The concepts of pseudoconvexity and invexity do not depend on a single definition of the g...

*Correspondence: [email protected] 1Department of Mathematics and Statistics, King Fahd University of Petroleum and Minerals, Dhahran, 31261, Saudi Arabia 2Permanent address: Department of Mathematics, Aligarh Muslim University, Aligarh, 202 002, India Full list of author information is available at the end of the article Abstract This paper is devoted to study interval-valued optimization p...

In this paper, we consider nonsmooth multiobjective fractional programming problems involving locally Lipschitz functions. We introduce the property of generalized invexity for fractional function. We present necessary optimality conditions, sufficient optimality conditions and duality relations for nonsmooth multiobjective fractional programming problems, which is for a weakly efficient soluti...

On the basis of arcwise connected convex functions and ( p , r ) −η - invex functions, we established H b –( p, –η- functions. Based on generalized assumption new solutions a class multiobjective fractional programming problems are studied, sufficient optimality condition for feasible to be efficient proved.

In this article, we introduce a new notion of generalized convex fuzzy mapping known as strongly preinvex on the invex set. Firstly, have investigated some properties mapping. particular, establish equivalence among mapping, and monotonicity. We also prove that optimality conditions for sum G-differentiable mappings non-G-differentiable can be characterized by mixed variational-like inequalitie...