Results 11 to 20 of about 565 (171)
Continuous-Time Multiobjective Optimization Problems via Invexity [PDF]
We introduce some concepts of generalized invexity for the continuous-time multiobjective programming problems, namely, the concepts of Karush-Kuhn-Tucker invexity and Karush-Kuhn-Tucker pseudoinvexity.
Valeriano A. De Oliveira +1 more
doaj +2 more sources
In this article, we study nonconvex multiobjective fractional programming problems involving E-differentiable functions (MFPE). We establish the E-Karush–Kuhn–Tucker (E-KKT) sufficient E-optimality conditions for nonsmooth vector optimization problems ...
Dhruv Singh +3 more
doaj +2 more sources
E-invexity and generalized E-invexity in E-differentiable multiobjective programming [PDF]
In this paper, a new concept of generalized convexity is introduced for not necessarily differentiable vector optimization problems. For an E-differentiable function, the concept of E-invexity is introduced as a generalization of the E-differentiable E ...
Abdulaleem Najeeb
doaj +3 more sources
D-Invexity and optimality conditions
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ye, Y.L
openaire +2 more sources
In this paper, a new class of ( C , G f ) -invex functions introduce and give nontrivial numerical examples which justify exist such type of functions. Also, we construct generalized convexity definitions (such as, ( F , G f ) -invexity,
Ramu Dubey +2 more
doaj +2 more sources
Higher-Order Generalized Invexity in Control Problems
We introduce a higher-order duality (Mangasarian type and Mond-Weir type) for the control problem. Under the higher-order generalized invexity assumptions on the functions that ...
S. K. Padhan, C. Nahak
doaj +2 more sources
The book presents an overview (and also some new results) on invex and related functions in various types of optimization problems (with single-valued objective functions, with vector-valued objective functions, and static as well as dynamic problems). The content of the book is structured as follows.
Mishra Shashi Kant, GIORGI, GIORGIO
openaire +2 more sources
Nonsmooth Multiobjective Fractional Programming with Local Lipschitz Exponential B-p,r-Invexity
We study nonsmooth multiobjective fractional programming problem containing local Lipschitz exponential B-p,r-invex functions with respect to η and b. We introduce a new concept of nonconvex functions, called exponential B-p,r-invex functions.
Shun-Chin Ho
doaj +2 more sources
w-Invexity and optimality problem
As the development of a family of preinvex functions, we define the w-invex set and a class of real functions. These are functions with the names w-preinvex, w-strictly preinvex, w-prequasi-invex, w-strictly prequasi-invex, w-semi-strictly prequasi-invex,
Musavvir Ali, Ehtesham Akhter
doaj +3 more sources
Generalized Minimax Programming with Nondifferentiable (G, β)-Invexity [PDF]
We consider the generalized minimax programming problem (P) in which functions are locally Lipschitz (G, β)-invex. Not only G-sufficient but also G-necessary optimality conditions are established for problem (P ...
D. H. Yuan, X. L. Liu
doaj +2 more sources

