Results in semi-E-convex functions

Main Article Content

Ayache Benhadid


The concept of convexity and its various generalizations is important for quantitative and qualitative studies in operations research or applied mathematics. Recently, E-convex sets and functions were introduced with important implications across numerous branches of mathematics. By relaxing the definition of convex sets and functions, a new concept of semi-EE-convex functions was introduced, and its properties are discussed. It has been demonstrated that if a function f:M→Rf:M→R is semi-EE-convex on an EE-convex set M⊂RnM⊂Rn then, f(E(x))≤f(x)f(E(x))≤f(x) for each x∈Mx∈M. This article discusses the inverse of this proposition and presents some results for convex functions.


Download data is not yet available.


Metrics Loading ...

Article Details

How to Cite
Benhadid, A. 2022. Results in semi-E-convex functions. Journal of Innovative Applied Mathematics and Computational Sciences. 2, 2 (Sep. 2022), 48–52. DOI:
Conference paper (ICMA'2021)


X. Chen, Some properties of semi-E-convex functions, J. Math. Anal. Appl., 275 (2002), 251–262.

G. Dal maso, An Introduction to G-convergence, BirKhauser, Boston, 1993.

A. A. Megahed, H. G. Gomma, E. A. Youness and A. H. Banna, Optimality conditions of E-convex programming for an E-differentiable function, J. Inequal. Appl., 246 (2013), 1–11.

M. A. Noor, M. U. Awan and K. I. Noor, On some inequalities for relative semi-convex functions, J. Inequal. Appl., 332 (2013), 1–16.

E. A. Youness, E-convex sets, E-convex functions, and E-convex programming, J. Optim. Theory Appl., 102 (1999), 439–450.