Exponentially E-preinvex and E-invex functions in mathematical programming
Abstract
In this paper, we introduce a new concept of generalized convexity for E-differentiable vector optimization problems. Namely, the notion of exponentially E-invexity is defined. Further, some properties and results of exponentially E-invex functions are studied. The sufficient optimality conditions are derived under appropriate (generalized) exponentially E-invexity hypotheses. To exemplify the application of our proposed concept, we have included an appropriate example.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.