Abstract
In this paper, we introduce a new concept of sets and a new class of functions called E-univex sets and E-univex functions, respectively. For an E-differentiable function, the concept of E-univexity is introduced by generalizing several concepts of generalized convexity earlier defined into optimization theory. In addition, some properties of E-differentiable E-univex functions are investigated. Further, also concepts of E-differentiable generalized E-univexity are introduced. Then, the sufficiency of the so-called E-Karush–Kuhn–Tucker necessary optimality conditions are proved for an E-differentiable nonlinear optimization problem in which the involved functions are E-univex and/or generalized E-univex.
Similar content being viewed by others
1 Introduction
Convexity and its various generalizations have played an essential role in the development of various fields of applied and pure sciences. In the recent past, convexity and its generalizations have piqued interest and used in establishing optimality conditions of optimization problems (see, for example, [1, 2, 5, 6, 9, 10, 12, 15,16,17,18,19,20, 25,26,27,28,29, 32], and others).
One of the generalizations of convexity is the concept of univexity introduced by Bector et al. [11] which unifies various concepts of generalized convexity established in literature. In [33], Youness introduced the concept of E-convexity. This kind of generalized convexity is based on the effect of an operator \(E : R^{n}\rightarrow R^{n}\) on the sets and the domain of functions. In recent years, this concept has attracted great interest from various researchers, and some properties of this concept were developed (see, for example, [3, 4, 6,7,8, 13, 14, 21,22,23,24, 30, 31, 34], and others). Later, Megahed et al. [23] introduced the definition of an E-differentiable function.
In this paper, the class of pre-E-univexity functions and classes of generalized pre-E-univexity functions are defined for not necessarily E-differentiable functions. Also, a new class of E-differentiable E-univex functions and new concept of E-univex sets are introduced. The concept of E-univexity is introduced by generalizing the concepts of convexity, univexity, B-vexity, invexity, E-B-invexity, E-convexity and E-invexity. Further, some properties of E-univex functions are studied and they are illustrated by some examples of such generalized convex functions. In addition, E-univex functions are extended to pseudo-E-univex, strictly pseudo-E-univex and quasi-E-univex functions. In order to show their applications, the sufficiency of the so-called E-Karush–Kuhn–Tucker necessary optimality conditions are proved for an E-differentiable nonlinear optimization problem in which the involved functions are E-univex and/or generalized E-univex. The aforesaid results are illustrated by a suitable example of a nonconvex optimization problem with (generalized) E-univex functions.
2 Preliminaries
Let \(R^{n}\) be the n-dimensional Euclidean space and \(R_{+}^{n}\) be its nonnegative orthant.
Definition 1
A function \(\varphi : M \rightarrow R\) is said to be increasing on a nonempty set \(M\subset R^{n}\) if and only if for all \(x, y \in M,\)
Definition 2
A function \(\varphi : M \rightarrow R\) is said to be strictly increasing on a nonempty set \(M\subset R^{n}\) if and only if for all \(x, y \in M,\)
Definition 3
[5]. Let \(E:R^{n}\rightarrow R^{n}\). A set \(M\subseteq R^{n}\) is said to be an E-invex set with respect to \(\eta :M\times M\rightarrow R^{n}\) if and only if the relation
holds for all \(x,u\in M\) and \(\lambda \in \left[ 0,1\right] \).
We recall the definition of a pre-univex function introduced by Bector et al. [11].
Definition 4
[11]. Let M be a nonempty invex subset of \(R^{n}.\) A real-valued function \(f:M\rightarrow R\) is said to be pre-univex on M with respect to \(\eta : M\times M\rightarrow R^{n},\) \(b: M\times M\times [0,1]\rightarrow R_{+}\) and \(\varPhi : R\rightarrow R\) if and only if the following inequality
holds for all \(x,u\in M\) and any \(\lambda \in \left[ 0,1\right] \).
Now, we introduce the concept of an E-pre-univex function. Let \(M\subseteq R^{n}\) be a nonempty E-invex set.
Definition 5
Let \(E:R^{n}\rightarrow R^{n}.\) A real-valued function \(f:M\rightarrow R\) is said to be E-pre-univex on M with respect to \(\eta : M\times M\rightarrow R^{n},\) \(b: M\times M\times [0,1]\rightarrow R_{+}\) and \(\varPhi : R\rightarrow R\) if and only if the following inequality
holds for all \(x,u\in M\) and any \(\lambda \in \left[ 0,1\right] \).
It is clear that every pre-univex function is E-pre-univex (if E is the identity map).
Definition 6
Let \(E:R^{n}\rightarrow R^{n}.\) A real-valued function \(f:M\rightarrow R\) is said to be strictly E-pre-univex on M with respect to \(\eta : M\times M\rightarrow R^{n},\) \(b: M\times M\times [0,1]\rightarrow R_{+}\) and \(\varPhi : R\rightarrow R\) if and only if the following inequality
holds for all \(x,u\in M\), \(E(x)\ne E(u)\), and any \(\lambda \in \left( 0,1\right) \).
Now, we present an example of such an E-pre-univex function which is not pre-univex.
Example 1
Let \(E:R\rightarrow R,\) \(f:R \rightarrow R\) and \(\varPhi :R \rightarrow R\) be defined by \(f(x)=\cos (x),\; \varPhi (x)=2x, \; E(x)=\frac{\pi }{2}-x,\) where
\(\eta (E(x) ,E(u)) = {\left\{ \begin{array}{ll} \frac{\sin (x)-\sin (u)}{\cos (u)} &{}\text{ if } x \ge u \wedge x,u\in (0,\frac{\pi }{2}) \\ 0 &{}\text{ otherewise } \end{array}\right. },\) \(b(E(x) ,E(u),\lambda ) = {\left\{ \begin{array}{ll} 1 &{}\text{ if } x \ge u \wedge x,u\in (0,\frac{\pi }{2}) \\ 0 &{}\text{ otherewise } \end{array}\right. }.\) Then, by Definition 5, f is an E-pre-univex function on R, while f is not pre-univex, because for \(x=\frac{\pi }{3},\) \(u=\frac{\pi }{6},\) and \(\lambda =\frac{1}{2},\) we have
Hence, f is not pre-univex with respect to \(\eta ,\) b, and \(\varPhi \) defined above. In other words, the class of E-pre-univex functions is larger than the class of pre-univex functions.
Definition 7
Let \(E:R^{n}\rightarrow R^{n}.\) A real-valued function \(f:M\rightarrow R\) is said to be E-pre-pseudounivex on M with respect to \(\eta : M\times M\rightarrow R^{n},\) \(b: M\times M\times [0,1]\rightarrow R_{+}\) and \(\varPhi : R\rightarrow R\) if and only if the following relation
holds for all \(x,u\in M\) and any \(\lambda \in \left[ 0,1\right] \).
Definition 8
Let \(E:R^{n}\rightarrow R^{n}.\) A real-valued function \(f:M\rightarrow R\) is said to be E-pre-quasiunivex on M with respect to \(\eta : M\times M\rightarrow R^{n},\) \(b: M\times M\times [0,1]\rightarrow R_{+}\) and \(\varPhi : R\rightarrow R\) if and only if the following relation
holds for all \(x,u\in M\) and any \(\lambda \in \left[ 0,1\right] \).
We now give the definition of an E-differentiable function introduced by Megahed et al. [23].
Definition 9
[23] Let \(E:R^{n}\rightarrow R^{n}\) and \(f:M\rightarrow R\) be a (not necessarily) differentiable function at a given point \(u\in M\). It is said that f is an E-differentiable function at u if and only if \( f\circ E\) is a differentiable function at u (in the usual sense), that is,
where \(\theta \left( u,x-u\right) \rightarrow 0\) as \(x\rightarrow u\).
Now, we introduce new concepts of generalized convexity for E-differentiable functions. Let \(M\subseteq R^{n}\) be a nonempty E-invex set with respect to \(\eta .\)
Definition 10
Let \(E:R^{n}\rightarrow R^{n}\) and \(f:M\rightarrow R\) be an E-differentiable function at u on M. It is said that f is E-univex at \(u\in M\) on M with respect to \(\eta ,\) b and \(\varPhi \) if, there exist \(\eta : M\times M\rightarrow R^{n},\) \(b: M\times M\rightarrow R_{+}\) and \(\varPhi : R\rightarrow R\) such that, for all \(x\in M\), the inequality
holds. If inequality (7) holds for any \(u\in M\), then f is E-univex with respect to \(\eta ,\) b and \(\varPhi \) on M.
Remark 1
Note that the Definition 10 generalizes and extends several generalized convexity notions, previously introduced in the literature. Indeed, there are the following special cases:
-
a)
If \(b(x ,u)=1\) and \(\varPhi (x)=x\), then the definition of an E-univex function reduces to the definition of an E-invex function introduced by Abdulaleem [5].
-
b)
If f is differentiable and \(E(x)\equiv x\) (E is an identity map), then the definition of an E-univex function reduces to the definition of an univex function introduced by Bector et al. [11].
-
c)
If f is differentiable, \(E(x)\equiv x\) (E is an identity map), \(b(x ,u)=1\) and \(\varPhi (x)=x\), then the definition of an E-univex function reduces to the definition of an invex function introduced by Hanson [15].
-
d)
If f is differentiable, \(E(x)\equiv x\) (E is an identity map) and \(\varPhi (x)=x\), then the definition of an E-univex function reduces to the definition of a B-invex function introduced by Bector et al. [9] and Suneja et al. [32].
-
e)
If \(\varPhi (x)=x\), then the definition of an E-univex function reduces to the definition of an E-B-invex function introduced by Abdulaleem [8].
-
f)
If \(\eta (x ,u)=x-u\), \(b(x ,u)=1\) and \(\varPhi (x)=x\), then we obtain the definition of an E-differentiable E-convex vector-valued function introduced by Megahed et al. [23].
-
g)
If f is differentiable, \(E(x)=x\) and \(\eta (x ,u)=x-u\), \(b(x ,u)=1\) and \(\varPhi (x)=x\), then the definition of an E-univex function reduces to the definition of a differentiable convex vector-valued function.
-
h)
If f is differentiable and \(\eta (x ,u)=x-u\), \(b(x ,u)=1\) and \(\varPhi (x)=x\), then we obtain the definition of a differentiable E-convex function introduced by Youness [33].
Definition 11
Let \(E:R^{n}\rightarrow R^{n}\) and \(f:M\rightarrow R\) be an E-differentiable function at u on M. It is said that f is strictly E-univex at \(u\in M\) on M with respect to \(\eta ,\) b and \(\varPhi \) if, there exist \(\eta : M\times M\rightarrow R^{n},\) \(b: M\times M\rightarrow R_{+}\) and \(\varPhi : R\rightarrow R\) such that, for all \(x\in M\; (E(x)\ne E(u))\), the inequality
holds. If inequality (8) holds for any \(u\in M\; (E(x)\ne E(u))\), then f is strictly E-univex with respect to \(\eta ,\) b and \(\varPhi \) on M.
Now, we present an example of such an E-univex function (with respect to \(\eta ,\) b and \(\varPhi \)) which is not univex (with respect to the same given \(\eta ,\) b and \(\varPhi \)), B-invex (with respect to the same given \(\eta \) and b), invex (with respect to the same given \(\eta \)) or convex.
Example 2
Let \(E:R\rightarrow R\) and \(f,\varPhi :R \rightarrow R\) be defined by \(f(x)=-x^{2},\)
\(\varPhi (x)=2x,\) \(E(x) = {\left\{ \begin{array}{ll} \sqrt{-x} &{}\text{ if } x\le 0 \\ 0 &{}\text{ otherwise } , \end{array}\right. }\) \(\eta (x ,u) = {\left\{ \begin{array}{ll} 2u^{2}-2x^{2} &{}\text{ if } x\le 0,\; u\le 0 \\ x-u &{}\text{ otherwise } , \end{array}\right. } \) \(b(x ,u) = {\left\{ \begin{array}{ll} 1 &{}\text{ if } x\le 0,\; u\le 0 \\ 0 &{}\text{ otherwise } \end{array}\right. }.\) Then f is an E-univex function on R with respect to \(\eta ,\) b and \(\varPhi \) defined above, but it is not univex with respect to \(\eta ,\) b and \(\varPhi \) defined above as can be seen by taking \(x=2\), \(u=4\), since the inequality
holds. Moreover, by the definition of an univex function [11], it follows that f is not univex with respect to \(\eta ,\) b and \(\varPhi \) given above. Also, f is not B-invex with respect to \(\eta ,\) b defined above as can be seen by taking \(x=1\), \(u=2\), since the inequality
holds. Note that, by the definition of a B-invex function (see, [9, 32]), it follows that f is not B-invex with respect to \(\eta , \; b\) given above. Further, f is not invex with respect to \(\eta \) defined above as can be seen by taking \(x=1\), \(u=0\), since the inequality
holds. Further, by the definition of an invex function [15], it follows that f is not invex on R with respect to \(\eta \) given above. It is not difficult to see that f is not a convex function.
Now, we present an example of such an E-differentiable E-univex function (with respect to \(\eta ,\) b and \(\varPhi \)) which is not E-invex (with respect to the same given \(\eta \)), E-B-invex (with respect to the same given \(\eta \) and b), or E-convex.
Example 3
Let \(E:R\rightarrow R\) and \(f,\varPhi :R \rightarrow R\) be defined by \(f(x)=\root 3 \of {x},\; \varPhi (x)=3x, \; E(x)=x^{9},\) where
\(\eta (E(x),E(u))\! =\! {\left\{ \begin{array}{ll} x^{2}\!+\!xu\!+\!u^{2} &{}\text{ if } x> u \\ x^{2}-u^{2} &{}\text{ otherwise, } \end{array}\right. } \) \(b(E(x),E(u)) \!=\! {\left\{ \begin{array}{ll} \frac{u^{2}}{x-u} &{}\text{ if } x> u \\ 0 &{}\text{ otherwise } \end{array}\right. }\!. \) Note that f is nondifferentiable at \(x=0,\) but \(f\circ E\) is a differentiable function at \(x=0\). Then, by Definition 10, f is an E-univex function on R with respect to \(\eta \), b and \(\varPhi \) given above. Moreover, as it follows from the definition of an E-B-invex function [8], f is not an E-B-invex function on R with respect to \(\eta \) and b given above as can be seen by taking \(x=2\), \(u=1\), since the inequality
holds. Also, f is not E-invex on R with respect to \(\eta \) defined above as can be seen by taking \(x=0\), \(u=-2\), since the inequality
holds. Note that, by the definition of an E-invex function [5], it follows that f is not E-invex on R with respect to \(\eta \) given above. Further, it is not difficult to see that, by the definition of an E-convex function [33], f is not E-convex at \(x=4\), \(u=1\), since the inequality
holds.
Definition 12
Let \(E:R^{n}\rightarrow R^{n}\) and \(f:M\rightarrow R\) be an E-differentiable function at u on M. It is said that f is pseudo-E-univex at \(u\in M\) on M with respect to \(\eta ,\) b and \(\varPhi \) if, there exist \(\eta : M\times M\rightarrow R^{n},\) \(b: M\times M\rightarrow R_{+}\) and \(\varPhi : R\rightarrow R\) such that, for all \(x\in M\), the following relation
holds for all \(x\in M\). If relation (9) holds for any \(u\in M\), then f is pseudo E-univex with respect to \(\eta ,\) b and \(\varPhi \) on M.
Definition 13
Let \(E:R^{n}\rightarrow R^{n}\) and \(f:M\rightarrow R\) be an E-differentiable function at u on M. It is said that f is strictly pseudo-E-univex at \(u\in M\) on M with respect to \(\eta ,\) b and \(\varPhi \) if, there exist \(\eta : M\times M\rightarrow R^{n},\) \(b: M\times M\rightarrow R_{+}\) and \(\varPhi : R\rightarrow R\) such that, for all \(x\in M\; (E(x)\ne E(u))\), the following relation
holds for all \(x\in M\). If relation (10) holds for any \(u\in M\; (E(x)\ne E(u))\), then f is strictly pseudo-E-univex with respect to \(\eta ,\) b and \(\varPhi \) on M.
Example 4
The function defined in Example 1 is E-univex on R but not strictly pseudo-E-univex, as can be seen by taking \(x=\frac{\pi }{4},\) \(u=\frac{\pi }{3},\) since \(\nabla f(E(u))\eta (E(x),E(u))= 0,\) but \(b(E(x),E(u))\varPhi \left[ f(E(x))-f(E(u))\right] = 0.\) Hence, by the definition of a strictly pseudo-E-univex function, it follows that f is not strictly pseudo-E-univex on R.
Definition 14
Let \(E:R^{n}\rightarrow R^{n}\) and \(f:M\rightarrow R\) be an E-differentiable function at u on M. It is said that f is quasi-E-univex at \(u\in M\) on M with respect to \(\eta ,\) b and \(\varPhi \) if, there exist \(\eta : M\times M\rightarrow R^{n},\) \(b: M\times M\rightarrow R_{+}\) and \(\varPhi : R\rightarrow R\) such that, for all \(x\in M\), the following relation
holds for all \(x\in M\). If relation (11) holds for any \(u\in M\), then f is quasi E-univex with respect to \(\eta ,\) b and \(\varPhi \) on M.
Remark 2
Every E-univex function is quasi-E-univex. However, the converse is not true.
Now, we present an example of such a quasi-E-univex function which is not E-univex.
Example 5
Let \(E:R\rightarrow R\) and \(f,\varPhi :R \rightarrow R\) be defined by \(f(x)=-\root 3 \of {x^{2}},\; \varPhi (x)=2x, \; E(x)=x^{3},\) \(\eta (E(x),E(u)) = {\left\{ \begin{array}{ll} x^{2}u+u &{}\text{ if } x\ge u, \\ x+u &{}\text{ if } x < u. \end{array}\right. } \) \(b(E(x),E(u)) = {\left\{ \begin{array}{ll} 1 &{}\text{ if } x\ge u, \\ 0 &{}\text{ if } x < u. \end{array}\right. }.\) Then, f is a quasi-E-univex function on R but not E-univex with respect to \(\eta ,\) b and \(\varPhi \) defined above. In fact, if we take, for example, \(x=1\), \(u=2\), then Definition 10 is not satisfied because
holds. Hence, by the definition of an E-univex function, it follows that f is not E-univex on R with respect to \(\eta ,\) b and \(\varPhi \) given above.
Now, we introduce the concept of an E-univex set.
Definition 15
Let \(E:R^{n}\rightarrow R^{n}\). A set \(S\subseteq R^{n}\times R\) is said to be an E-univex set with resect to \(\eta : M\times M\rightarrow R^{n},\) \(b: M\times M\times [0,1]\rightarrow R_{+}\) and \(\varPhi : R\rightarrow R,\) if for any \((E(x),\beta )\in S\), \((E(u),\gamma )\in S\) the relation
holds for any \(\lambda \in \left[ 0,1\right] \).
Remark 3
If \(E(x)=x\), then the definition of an E-univex set with respect to \(\eta ,\) b, and \(\varPhi \) reduces to the definition of an univex set with respect to \(\eta ,\) b, and \(\varPhi \) (see Bector et al. [11]).
Now, we present an example of such an E-univex set with respect to \(\eta ,\) b, and \(\varPhi \) which is not an univex set with respect to \(\eta ,\) b, and \(\varPhi .\)
Example 6
Let \(S=\left( [1,16]\cup [-16,-1]\right) \times [1,4]\) and \(E,\varPhi :R\rightarrow R,\) be defined by \(\varPhi (x)\!=\!2x,\) \(E(x) \!=\! {\left\{ \begin{array}{ll} x^{2} &{}\text{ if } -4\le x \le 4 \\ -1 &{} \text {otherwise} \end{array}\right. },\) \(\eta (x ,u) = {\left\{ \begin{array}{ll} x-u &{}\text{ if } x\le u \\ -16-u &{} \text {otherwise} \end{array}\right. },\) \(b(x ,u,\lambda ) = {\left\{ \begin{array}{ll} 1 &{}\text{ if } x\le u \\ 0 &{} \text {otherwise} \end{array}\right. }.\) Then, by Definition 15, S is an E-univex set with respect to \(\eta ,\) b, and \(\varPhi \) given above. However, as it follows from the definition of an univex set [11], S is not an univex set with respect to \(\eta ,\) b, and \(\varPhi \) given above as can be seen by taking \(x = -1\), \(u= 1,\) \(\gamma =1,\) \(\beta =1\) and \(\lambda =\frac{1}{2},\) we obtain
Theorem 1
Let \(E:R^{n}\rightarrow R^{n}\). If \((S_{i})_{i\in I},\; i \in I = \{1,...,k\}\) is a family of E-univex sets in \(R^{n}\times R\) with respect to \(\eta : M\times M\rightarrow R^{n},\) \(b: M\times M\times [0,1]\rightarrow R_{+}\) and \(\varPhi : R\rightarrow R\), then their intersection \(\bigcap _{i\in I} S_{i}\) is an E-univex set.
Proof
Let \(E:R^{n}\rightarrow R^{n}\) and \((E(x),\beta )\in \bigcap _{i\in I} S_{i},\; (E(u),\gamma )\in \bigcap _{i\in I} S_{i},\) \(\lambda \in \left[ 0,1\right] \). Since each \(S_{i}\) is an E-univex set therefore, for each \(i\in I\), \((E(x),\beta )\in S_{i},\; (E(u),\gamma )\in S_{i},\) and, moreover,
Thus,
which completes the proof of this theorem. \(\square \)
Now, we give the definition of E-epigraph and we discuss a characterization of an E-univex function in terms of its E-epigraph.
Definition 16
Let \(E:M\rightarrow M.\) We define the E-epigraph of \(f:M\rightarrow R\) as follows
Now, we give an example that sets of the E-epigraph of f and the epigraph of f are not equal.
Example 7
Let \(S=[0,4]\times R\), \(E:R\rightarrow R\) and \(f, \varPhi :R \rightarrow R\) be defined by \(f(x)=|x|, \; E(x)=x^{2},\) \(\varPhi (x)=2x,\) \(\eta (E(x) ,E(u)) = {\left\{ \begin{array}{ll} \frac{2x^{2}-2u^{2}}{2u} &{}\text{ if } xu\ne 0 \\ 0 &{} otherwise \end{array}\right. },\) \(b(E(x) ,E(u),\lambda ) = {\left\{ \begin{array}{ll} 1 &{}\text{ if } xu\ne 0 \\ 0 &{} otherwise \end{array}\right. }.\) Then, by Definition 10, f is an E-univex function on R with respect to \(\eta \), b and \(\varPhi \) given above. Further, the E-epigraph of f
is E-univex on \([0,4]\times R\). This means that, for any \((E(x),\beta )\in S\), \((E(u),\gamma )\in S\) the following inequality
holds for any \(\lambda \in \left[ 0,1\right] \).
Note that function f in Example 7 show that sets epi\(_{E}(f)\) and epi (f) given in [11] are not equal. Thus,
hence, epi\(_{E}(f)\ne \) epi (f).
Now, we give a sufficient condition for the function f to be an E-univex function.
Theorem 2
Let \(E:M\rightarrow M\) and \(f:M\rightarrow R\) be a function defined on an E-invex set with respect to \(\eta \). If the E-epigraph epi\(_{E}\) (f) of f is an E-univex set in \(M\times R\) with respect to \(\eta ,\) b and \(\varPhi \), then f is an E-univex function on M.
Proof
Assume that \(\text {epi}_{E}(f)\) is an E-univex set. Let \(x, u\in M\), then \((E(x), f(E(x)))\in \text {epi}_{E}(f)\), \((E(u), f(E(u)))\in \text {epi}_{E}(f)\). By E-univexity of the set \(\text {epi}_{E}(f)\) in \(M\times R\) with respect to \(\eta ,\) b and \(\varPhi \), we have
for \(\lambda b(E(x),E(u),\lambda )\in [0,1],\) from which it follows that
for \(\lambda b(E(x),E(u),\lambda )\in [0,1].\) Hence f is an E-univex function. \(\square \)
Definition 17
Let \(E:R^{n}\rightarrow R^{n}\). It said that \({\overline{x}}\in R^{n}\) is a global E-minimizer of \( f:M\rightarrow R\) if the inequality
holds for all \(x\in M\).
Proposition 1
Let \(E:R^{n}\rightarrow R^{n}\) and \(f:M\rightarrow R\) be an E-differentiable function on M. If \({\overline{x}}\in M\) is a global E-minimizer of f, then \(\nabla f\left( E( {\overline{x}})\right) =0\).
Proof
We assume that \({\overline{x}}\in M\) is a global E-minimizer of f and let \(d=-\nabla f\left( E( {\overline{x}})\right) \). Now, we prove that there does not exist \(d=-\nabla f\left( E( {\overline{x}})\right) \in R^n\), \(d\ne 0\), satisfying the inequality
By assumption, f is E-differentiable at \({\overline{x}}\). Thus, by Definition 9, we have
where \(\theta _{f}\left( {\overline{x}},x-{\overline{x}}\right) \rightarrow 0\) and \(\frac{x-{\overline{x}}}{\left\| x-{\overline{x}} \right\| }\rightarrow d\) as \(x \rightarrow {\overline{x}}\) together with (16), we get that the following inequality
holds, which is a contradiction to the assumption that \({\overline{x}}\in M\) is a global E-minimizer of f. This means that (16) is not satisfied. Thus, \( \nabla f\left( E( {\overline{x}})\right) d=0,\) for all \(d\in R^{n}.\) This implies that \( \nabla f\left( E( {\overline{x}})\right) =0.\) \(\square \)
Proposition 2
Let \(E:R^{n}\rightarrow R^{n}\) be an operator, \(\varPhi :R\rightarrow R\) be strictly increasing with \(\varPhi (0)=0,\) \(b(E(x),E({\overline{x}}))>0\) and \(f:R^{n}\rightarrow R\) be an E-differentiable E-univex function on M with respect to \(\eta ,\) \(\varPhi \) and b. If \(\nabla f\left( E( {\overline{x}})\right) =0\), then \({\overline{x}}\) is an E-minimizer of f.
Proof
Let \(E:R^{n}\rightarrow R^{n}\) be an operator. Further, assume that \( f:M\rightarrow R\) is an E-differentiable E-univex function on M with respect to \(\eta ,\) \(\varPhi \) and b. Hence, by Definition 10, the inequality
holds for all \(x\in M.\) Since \(\varPhi :R\rightarrow R\) is strictly increasing with \(\varPhi (0)=0,\) \(b(E(x),E({\overline{x}}))>0,\) \(\nabla f\left( E( {\overline{x}})\right) =0\) and (18), therefore, we have that the relation
implies that the inequality
holds for all \(x\in M\). This means, by Definition 17, that \({\overline{x}}\) is an E-minimizer of f. \(\square \)
Proposition 3
Let \(E:R^{n}\rightarrow R^{n}\) be an operator, \(\varPhi :R\rightarrow R\) be strictly increasing with \(\varPhi (0)=0,\) \(b(E(x),E({\overline{x}}))>0\) and \(f:R^{n}\rightarrow R\) be an E-differentiable pseudo-E-univex function on M with respect to \(\eta ,\) \(\varPhi \) and b. If \(\nabla f\left( E( {\overline{x}})\right) =0\), then \({\overline{x}}\) is an E-minimizer of f.
Proof
The proof of this proposition follows from Definitions 12 and 17 . \(\square \)
3 Optimality Conditions for E-Differentiable Optimization Problem
In the paper, we consider the following constrained optimization problem:
where \(f:R^{n}\rightarrow R\) and \(g_{i}:R^{n}\rightarrow R\), \(i\in I\), are E-differentiable functions on \( R^{n}\). We will write \(g:=\left( g_{1},...,g_{k}\right) :R^{n}\rightarrow R^{k}\) for convenience. Let
be the set of all feasible solutions of (P). Further, \(I\left( {\overline{x}}\right) \) is the set of all active inequality constraints at point \({\overline{x}}\in D\), that is, \( I\left( {\overline{x}}\right) =\left\{ i\in I:g_{i}\left( {\overline{x}}\right) =0\right\} .\)
Definition 18
A point \({\overline{x}}\) is said to be an optimal solution of (P) if and only if there exists no other feasible point x such that
Now, for the considered E-differentiable optimization problem (P), we define its associated differentiable E-optimization problem (P\(_{E}\)) as follows:
We call the problem (P\(_{E}\)) an E-optimization problem. Let
be the set of all feasible solutions of (P\(_{E}\)).
Definition 19
A point \(E({\overline{x}})\) is said to be an E-optimal solution of (P) if and only if there exists no other feasible point E(x) such that
Lemma 1
[3]. Let \(E:R^{n}\rightarrow R^{n}\) be a one-to-one and onto operator. Then \(E\left( D_{E}\right) =D\).
Lemma 2
Let \({\overline{y}}\in D \) be an E-optimal solution of (P). Then, there exists \({\overline{x}}\in D_{E}\) such that \({\overline{y}}=E({\overline{x}})\) and \({\overline{x}}\) is an optimal solution of (P\(_{E}\)).
Proof
Let \({\overline{y}}\in D\) be an E-optimal solution of (P). By Lemma 1, it follows that there exists \({\overline{x}} \in D _{E}\) such that \({\overline{y}}=E\left( {\overline{x}}\right) \). Now, we prove that \({\overline{x}}\) is an optimal solution of (P\(_{E}\)). By means of contradiction, suppose that \( {\overline{x}}\) is not an optimal solution of (P\(_{E}\)). Then, by Definition 19, there exists \({\widehat{x}}\in D_{E}\) such that \(f(E ({\widehat{x}}))<f(E({\overline{x}}))\). By Lemma 1, we have that there exists \({\widehat{y}}\in D\) such that \({\widehat{y}}=E\left( {\widehat{x}}\right) \). Hence, the inequality above implies that \(f({\widehat{y}})<f({\overline{y}})\), which is a contradiction to the optimal solution of \({\overline{y}}\) for (P). The proof in the case when \({\overline{y}}\in D \) is an E-optimal solution of (P) is similar. \(\square \)
Theorem 3
[5, 23] . (E-Karush–Kuhn–Tucker necessary optimality conditions). Let the objective function f, the constraint functions \(g_{i},\) \(i\in I\), be E -differentiable at \({\overline{x}}\in D_{E}\). Further, let \({\overline{x}}\) be an optimal solution of (P\(_{E}\)) (and, thus, \( E\left( {\overline{x}}\right) \) be an E-optimal solution of (P)) and the E-Guignard constraint qualification [5] be satisfied at \({\overline{x}}\). Then, there exist Lagrange multiplier \({\overline{\lambda }}\in R^{k}\) such that
Definition 20
It is said that \(\left( E\left( {\overline{x}}\right) , {\overline{\lambda }}\right) \in D\times R^{k}\) is an E-Karush–Kuhn–Tucker point (E-KKT-point, in short) for the considered optimization problem (P) if the E-Karush–Kuhn–Tucker necessary optimality conditions (20)–(22) are satisfied at \(E({\overline{x}})\) with Lagrange multiplier \({\overline{\lambda }}\).
Now, we prove the sufficiency of the E-KKT necessary optimality conditions for the considered E-differentiable optimization problem (P) under E-univexity hypotheses.
Theorem 4
Let \(\left( {\overline{x}},{\overline{\lambda }}\right) \in D_{E} \times R^{k}\) be a KKT-point of the E-optimization problem (P\(_{E}\)). Further, assume the following hypotheses are fulfilled:
-
a)
the objective function f, is E-univex at \({\overline{x}}\) on \(D _{E}\) with respect to \(\eta ,\) \(\varPhi _{f}\) and \(b_{f}\),
-
b)
each inequality constraint \(g_{i}\), \(i\in I_{E}\left( {\overline{x}}\right) \), is E-univex at \({\overline{x}}\) on \(D _{E}\) with respect to \(\eta ,\) \(\varPhi _{g_{i}}\) and \(b_{g_{i}}\),
-
c)
\(\varPhi _{f}\) is strictly increasing and \(\varPhi _{g_{i}},\; i\in I\) is increasing with \(\varPhi _{f}(0)=0\) and \(\varPhi _{g_{i}}(0)=0,\)
-
d)
\(b_{f}\left( E\left( x \right) ,E\left( {\overline{x}}\right) \right) >0\) and \(b_{g_{i}}\left( E\left( x \right) ,E\left( {\overline{x}}\right) \right) \ge 0,\; i\in I_{E}\left( {\overline{x}}\right) \) for all \(x\in D _{E}.\)
Then \({\overline{x}}\) is an optimal solution of the problem (P\(_{E}\)) and, thus, \(E\left( {\overline{x}}\right) \) is an E-optimal solution of the problem (P).
Proof
By assumption, \(\left( {\overline{x}},{\overline{\lambda }}\right) \in D_{E} \times R^{k}\) is a KKT-point of the problem (P\(_{E}\)). Then, by Definition 20, the E-KKT necessary optimality conditions (20)–(22) are satisfied at \( {\overline{x}}\) with Lagrange multiplier \({\overline{\lambda }}\in R^{k}\). We proceed by contradiction. Suppose, contrary to the result, that \({\overline{x}}\) is not an optimal solution of (P\(_{E}\)). Hence, by Definition 19, there exists another \(x\in D_{E}\) such that
that is
Since \(\varPhi _{f}\) is strictly increasing with \(\varPhi _{f}(0)=0\) and \(b_{f}\left( E\left( x \right) ,E\left( {\overline{x}}\right) \right) >0,\) therefore, we have
From hypothesis a), by Definition 10, the following inequality
holds. Combining (25) and (26), we get
From hypothesis b), by Definition 10, the following inequalities
hold. Multiplying inequalities (28) by the corresponding Lagrange multipliers, we obtain
and, moreover, by \(g(E\left( {\overline{x}}\right) )=0,\)
Since \(\varPhi _{g_{i}},\; i\in I,\) is increasing and satisfies \(\varPhi _{g_{i}}(0)=0,\) then, using (30) together with \(x \in D _{E}\) and \({\overline{x}}\in D _{E} \), we obtain
Thus,
Combining (27) and (32), we obtain that the following inequality
holds, which is a contradiction to the E-KKT necessary optimality condition (20). Since \({\overline{x}}\) is an optimal solution of the problem (P\(_{E}\)), by Lemma 2, \(E\left( {\overline{x}}\right) \) is an E-optimal solution of the problem (P). Thus, the proof of this theorem is completed. \(\square \)
Theorem 5
Let \(\left( {\overline{x}},{\overline{\lambda }}\right) \in D_{E} \times R^{k}\) be a KKT-point of the E-optimization problem (P\(_{E}\)). Further, assume the following hypotheses are fulfilled:
-
a)
the function f, is strictly E-univex at \({\overline{x}}\) on \(D _{E}\) with respect to \(\eta ,\) \(\varPhi _{f}\) and \(b_{f}\),
-
b)
each constraint function \(g_{i}\), \(i\in I_{E}\left( {\overline{x}}\right) \), is E-univex at \({\overline{x}}\) on \(D _{E}\) with respect to \(\eta ,\) \(\varPhi _{g_{i}}\) and \(b_{g_{i}}\),
-
c)
\(\varPhi _{f}\) is strictly increasing and \(\varPhi _{g_{i}},\; i\in I\) is increasing with \(\varPhi _{f}(0)=0\) and \(\varPhi _{g_{i}}(0)=0,\)
-
d)
\(b_{f}\left( E\left( x \right) ,E\left( {\overline{x}}\right) \right) >0\) and \(b_{g_{i}}\left( E\left( x \right) ,E\left( {\overline{x}}\right) \right) \ge 0,\; i\in I_{E}\left( {\overline{x}}\right) \) for all \(x\in D _{E}.\)
Then \({\overline{x}}\) is an optimal solution of the problem (P\(_{E}\)) and, thus, \(E\left( {\overline{x}}\right) \) is an E-optimal solution of the problem (P).
In order to illustrate the sufficient optimality conditions established in Theorem 4, we now present an example of an E-differentiable optimization problem in which the involved functions are E-univex.
Example 8
Consider the following nondifferentiable optimization problem
Note that the set of all feasible solutions of (P1) is \( D =\{ \left( x_{1},x_{2}\right) \in R^{2}: (\sin {\root 3 \of {x_{1}}}-1)^{2}+\sin {\root 3 \of {x_{2}}}-1\le 0,\; 2\root 3 \of {x_{1}}+3\root 3 \of {x_{2}}-\frac{9}{2}\le 0,\; \root 3 \of {x_{1}^{2}}+\root 3 \of {x_{2}^{2}}-3\le 0,\; -\sin {\root 3 \of {x_{1}}}\le 0,\; \;-\sin {\root 3 \of {x_{2}}}\le 0\}. \) Let
and \(\varPhi _{f}(x)=\varPhi _{g_{i}}(x)=2x.\) The functions constituting problem (P1) are nondifferentiable at \(\left( 0,0\right) \). Let \(E:R^{2}\rightarrow R^{2}\) be defined as follows \(E\left( x_{1},x_{2}\right) =\left( x_{1}^{3},x_{2}^{3}\right) \). Now, for the considered E-differentiable problem (P1), we define its associated differentiable problem (P1\(_{E}\)) as follows
Note that the set of all feasible solutions of the problem (P1\(_{E}\)) is \( D_{E} =\{ \left( x_{1},x_{2}\right) \in R^{2}: (\sin {{x_{1}}}-1)^{2}+\sin {{x_{2}}}-1\le 0,\; 2{x_{1}}+3{x_{2}}-\frac{9}{2}\le 0,\; {x_{1}^{2}}+{x_{2}^{2}}-3\le 0,\; -\sin {{x_{1}}}\le 0,\; \;-\sin {{x_{2}}}\le 0\}. \) Note that all functions constituting the problem (P1\(_{E}\)) are differentiable at \(\left( 0,0\right) \). Then, it can also be shown that the E-Karush–Kuhn–Tucker necessary optimality conditions (20)–(22) are fulfilled at \(\left( 0,0\right) \) with Lagrange multipliers \({\overline{\lambda }}=(\frac{1}{4},0,0,\frac{1}{2},\frac{5}{4}).\) Further, all hypotheses of Theorem 4 are fulfilled, it can be proved that f, is E-univex at \({\overline{x}}\) on \(D _{E}\) with respect to \(\eta ,\) \(b_{f}\) and \(\varPhi _{f}\) given above, each function \(g_{i}\), \(i=1,2,...,5\), is E-univex at \({\overline{x}}\) on \(D _{E}\) with respect to \(\eta ,\) \(b_{g_{i}}\) and \(\varPhi _{g_{i}}\) given above. Hence, \({\overline{x}}=\left( 0,0\right) \) is an optimal solution of the problem (P1\(_{E}\)) and, thus, \(E\left( {\overline{x}}\right) =\left( 0,0\right) \) is an E-optimal solution of the problem (P). Further, that the sufficient optimality conditions under univexity are not applicable since not all functions constituting problem (P1) are differentiable univex with respect to \(\eta , \; b\) given above (see, Bector et al. [11]). Moreover, that the sufficient optimality conditions under E-invexity are not applicable since not all functions constituting problem (P1) are E-invex with respect to \(\eta \) given above.
Now, under generalized E-univexity notions, we prove the sufficient optimality conditions for the problem (P\(_{E}\)).
Theorem 6
Let \(\left( {\overline{x}},{\overline{\lambda }}\right) \in D_{E} \times R^{k}\) be a KKT-point of the E-optimization problem (P\(_{E}\)). Further, assume the following hypotheses are fulfilled:
-
a)
the function f, is pseudo-E-univex at \({\overline{x}}\) on \(D _{E}\) with respect to \(\eta ,\) \(\varPhi _{f}\) and \(b_{f}\),
-
b)
each constraint function \(g_{i}\), \(i\in I_{E}\left( {\overline{x}}\right) \), is quasi-E-univex at \({\overline{x}}\) on \(D _{E}\) with respect to \(\eta ,\) \(\varPhi _{g_{i}}\) and \(b_{g_{i}}\),
-
c)
\(\varPhi _{f}\) is strictly increasing and \(\varPhi _{g_{i}},\; i\in I\) is increasing with \(\varPhi _{f}(0)=0\) and \(\varPhi _{g_{i}}(0)=0,\)
-
d)
\(b_{f}\left( E\left( x \right) ,E\left( {\overline{x}}\right) \right) >0\) and \(b_{g_{i}}\left( E\left( x \right) ,E\left( {\overline{x}}\right) \right) \ge 0,\; i\in I_{E}\left( {\overline{x}}\right) \) for all \(x\in D _{E}.\)
Then \({\overline{x}}\) is an optimal solution of the problem (P\(_{E}\)) and, thus, \(E\left( {\overline{x}}\right) \) is an E-optimal solution of the problem (P).
Proof
By assumption, \(\left( {\overline{x}},{\overline{\lambda }}\right) \in D_{E} \times R^{k}\) be a KKT-point of the E-optimization problem (P\(_{E}\)). Then, by Definition 20, the KKT necessary optimality conditions (20)–(22) are satisfied at \({\overline{x}}\) with Lagrange multiplier \({\overline{\lambda }}\in R^{k}\). We proceed by contradiction. Suppose, contrary to the result, that \({\overline{x}}\) is not an optimal solution of (P\(_{E}\)). Hence, by Definition 19, there exists another \(x\in D_{E}\) such that
Thus,
Since \(\varPhi _{f}\) is strictly increasing, \(\varPhi _{f}(0)=0\) and \(b_{f}\left( E\left( x \right) ,E\left( {\overline{x}}\right) \right) >0,\) we obtain
By assumption, f is pseudo-E-univex at \({\overline{x}}\) on \(D _{E}\) with respect to \(\eta ,\) \(\varPhi _{f}\) and \(b_{f}.\) Then, by Definition 12, we get
From \(x\in D_{E} \), \(x\in D_{E}\), the E-KKT necessary optimality conditions (6) and (22) imply
Since the function \(\varPhi _{g_{i}}\) is increasing and \(\varPhi _{g_{i}}(0)=0\) and \(b_{g_{i}}\left( E\left( x \right) ,E\left( {\overline{x}}\right) \right) \ge 0,\) by Definition 14, we have
By assumption, \(g_{i}\) is quasi-E-univex at \({\overline{x}}\) on \(D _{E}\) with respect to \(\eta ,\) \(\varPhi _{g_{i}}\) and \(b_{g_{i}}.\) Then, by Definition 14, we get
Thus, by \({\overline{\lambda }}_{i}\ge 0,\; i\in I\left( E\left( {\overline{x}}\right) \right) ,\) we obtain
Hence, taking into account \({\overline{\lambda }}_{i}=0\), \(i\notin I\left( E\left( {\overline{x}}\right) \right) \), we have
Combining (36) and (38), we get that the following inequality
which is a contradiction to the E-KKT necessary optimality condition (21). Since \({\overline{x}}\) is an optimal solution of the problem (P\(_{E}\)), by Lemma 2, \(E\left( {\overline{x}}\right) \) is an E-optimal solution of the problem (P). Thus, the proof of this theorem is completed. \(\square \)
Theorem 7
Let \(\left( {\overline{x}},{\overline{\lambda }}\right) \in D_{E} \times R^{k}\) be a KKT-point of the E-optimization problem (P\(_{E}\)). Further, assume the following hypotheses are fulfilled:
-
a)
the function f, is strictly pseudo-E-univex at \({\overline{x}}\) on \(D _{E}\) with respect to \(\eta ,\) \(\varPhi _{f}\) and \(b_{f}\),
-
b)
each constraint function \(g_{i}\), \(i\in I_{E}\left( {\overline{x}}\right) \), is quasi-E-univex at \({\overline{x}}\) on \(D _{E}\) with respect to \(\eta ,\) \(\varPhi _{g_{i}}\) and \(b_{g_{i}}\),
-
c)
\(\varPhi _{f}\) is strictly increasing and \(\varPhi _{g_{i}},\; i\in I\) is increasing with \(\varPhi _{f}(0)=0\) and \(\varPhi _{g_{i}}(0)=0,\)
-
d)
\(b_{f}\left( E\left( x \right) ,E\left( {\overline{x}}\right) \right) >0\) and \(b_{g_{i}}\left( E\left( x \right) ,E\left( {\overline{x}}\right) \right) \ge 0,\; i\in I_{E}\left( {\overline{x}}\right) \) for all \(x\in D _{E}.\)
Then \({\overline{x}}\) is an optimal solution of the problem (P\(_{E}\)) and, thus, \(E\left( {\overline{x}}\right) \) is an E-optimal solution of the problem (P).
Example 9
Consider the following nonconvex nondifferentiable optimization problem
where,
\(g_{1}(x)=\left\{ \begin{array}{ll} -\root 3 \of {x} \;\;\;&{} \hbox {if\;} x<0, \\ \\ 1-e^{\root 3 \of {x}} \;\;\;&{} \hbox {if\;}x\ge 0. \end{array} \right. \) \(\;\;\; \;\;\; g_{2}(x)=\left\{ \begin{array}{ll} \root 3 \of {x^{2}} \;\;\;&{} \hbox {if\;} x<0, \\ \\ -\root 3 \of {x} \;\;\;&{} \hbox {if\;} x\ge 0. \end{array} \right. \)
Let \(\eta (x,u)=(\root 3 \of {x}-u)^5,\) \(\varPhi _{f}(x)=\varPhi _{g_{i}}(x)=3x,\) \(b_{f}(x,u)=\frac{1}{3}x^{\frac{4}{3}}+u+1,\) \(b_{g_{1}}(x,u)=b_{g_{2}}(x,u)=\left\{ \begin{array}{ll} 1 \;&{} \hbox {if\;} x<u, \\ \\ 0 &{} \hbox {if\;} x\ge u. \end{array} \right. .\) The functions constituting problem (P2) are nondifferentiable at 0. Let \(E:R\rightarrow R\) be defined as follows \(E\left( x\right) =x^{3}\). Now, for the considered E-differentiable problem (P2), we define its associated differentiable problem (P2\(_{E}\)) as follows
where,
\(g_{1}(E(x))=\left\{ \begin{array}{ll} -{x} \;\;\;&{} \hbox {if\;} x<0, \\ \\ 1-e^{x} \;\;\;&{} \hbox {if\;}x\ge 0. \end{array} \right. \) \(\;\;\; \;\;\; g_{2}(E(x))=\left\{ \begin{array}{ll} x^{2} \;\;\;&{} \hbox {if\;} x<0, \\ \\ -x \;\;\;&{} \hbox {if\;} x\ge 0. \end{array} \right. .\) Note that the set of all feasible solutions of the problem (P2\(_{E}\)) is \( D_{E} =\{ x\in R: x\ge 0\}. \) It can be shown that the E-Karush–Kuhn–Tucker necessary optimality conditions (20)–(22) are fulfilled at \({\overline{x}}=0\) with Lagrange multipliers \({\overline{\lambda }}_{1}={\overline{\lambda }}_{2}=\frac{1}{2}.\) Further, all hypotheses of Theorem 6 are fulfilled, it can be show that f, is pseudo-E-univex at \({\overline{x}}\) on \(D _{E}\) with respect to \(\eta ,\) \(\varPhi _{f}\) and \(b_{f}\) given above, functions \(g_{1}\) and \(g_{2}\) are quasi-E-univex at \({\overline{x}}\) on \(D _{E}\) with respect to \(\eta ,\) \(\varPhi _{g_{i}}\) and \(b_{g_{i}}\) given above. Hence, \({\overline{x}}=0\) is an optimal solution of the problem (P2\(_{E}\)) and, thus, \(E({\overline{x}})=0\) is an E-optimal solution of the problem (P2) (Fig. 1).
Example 10
Consider the following nonconvex nondifferentiable optimization problem
Note that \(D=\left\{ x\in R:1-e^{\root 3 \of {x}}\le 0, -\arctan \root 3 \of {x}\le 0\right\} \) is the feasible solution set of the considered optimization problem (P3). Let
\(b_{f}(x,u) = b_{g_{1}}(x,u) = {\left\{ \begin{array}{ll} \frac{\root 3 \of {u^{2}}}{\root 3 \of {x}-\root 3 \of {u}} &{}\text{ if } x>u \\ 0 &{}\text{ if } x\le u \end{array}\right. },\) \(b_{g_{2}}(x,u = {\left\{ \begin{array}{ll} u+1 &{}\text{ if } x> u \\ 0 &{}\text{ if } x\le u \end{array}\right. },\) and \(\varPhi (x)=3x.\) Let \(E:R\rightarrow R\) be a mapping defined by \( E\left( x\right) =x^{3}.\) Then, we define the following differentiable E-optimization problem (P3\(_{E}\)) as follows
Note that \(D_{E}=\left\{ x\in R:x\ge 0\right\} \) is the feasible solution set of the problem (P3\(_{E}\)) and \({\overline{x}} = 0\) is a feasible solution of the nonlinear optimization problem (P3\(_{E}\)). Then, all hypotheses of Theorem 7 are fulfilled, it can be show that f, is strictly pseudo-E-univex at \({\overline{x}}\) on \(D _{E}\) with respect to \(\eta ,\) \(\varPhi _{f}\) and \(b_{f}\) given above, functions \(g_{1}\) and \(g_{2}\) are quasi-E-univex at \({\overline{x}}\) on \(D _{E}\) with respect to \(\eta ,\) \(\varPhi _{g_{i}}\) and \(b_{g_{i}}\) given above. Hence, \({\overline{x}}=0\) is an optimal solution of the problem (P3\(_{E}\)) and, thus, \(E({\overline{x}})=0\) is an E-optimal solution of the problem (P3).
4 Concluding Remarks
In the paper, new concepts of nondifferentiable generalized convexity notions have been introduced. The so-called E-differentiable E-univexity unify the concepts of convexity, univexity defined by Bector et al. [11], B-invexity defined by Bector et al. [9], Suneja et al. [32], invexity defined by Hanson [15], E-B-invexity defined by Abdulaleem [8], E-convexity defined by Youness [33] and E-invexity defined by Abdulaleem [5]. Further, some properties of E-univex functions have been studied. Also E-univex functions have been extended to pseudo-E-univex, strictly pseudo-E-univex and quasi-E-univex functions. In order to show their applications, the sufficiency of the so-called E-Karush–Kuhn–Tucker necessary optimality conditions have been proved for a nonlinear E-differentiable optimization problem in which the involved functions are E-univex and/or generalized E-univex. The aforesaid results have been illustrated by an example of nonconvex E-differentiable optimization problem with E-univex functions. Hence, the optimality results have been generalized and extended in the paper to new classes of E-differentiable optimization problems in comparison to those ones actually existing in the optimization literature.
However, some interesting topics for further research remain. It would be of interest to investigate whether it is possible to prove similar results for other classes of E-differentiable optimization problems. We shall investigate these questions in subsequent papers.
Data availability
Not applicable.
References
Antczak, T.: \((p, r)\)-invex sets and functions. J. Math. Anal. Appli. 263, 355–379 (2001)
Antczak, T.: A class of \(B\)-\((p, r)\)-invex functions and mathematical programming. J. Math. Anal. Appli. 286, 187–206 (2003)
Antczak, T., Abdulaleem, N.: \(E\)-optimality conditions and Wolfe \(E\)-duality for \(E\)-differentiable vector optimization problems with inequality and equality constraints. J. Nonlinear Sci. Appl. 12, 745–764 (2019)
Antczak, T., Abdulaleem, N.: Optimality and duality results for \(E\)-differentiable multiobjective fractional programming problems under \(E\)-convexity. J. Inequal. Appl. 2019, 292 (2019)
Abdulaleem, N.: \(E\)-invexity and generalized \(E\)-invexity in \(E\)-differentiable multiobjective programming. ITM Web of Conferences 24, 01002 (2019)
Abdulaleem, N.: \(V\)-\(E\)-invexity in \(E\)-differentiable multiobjective programming. Numer. Algebra Control Optim. 1-17 (2021) https://doi.org/10.3934/naco.2021014
Abdulaleem, N.: \(E\)-optimality conditions for \(E\)-differentiable \(E\)-invex multiobjective programming problems. WSEAS Transactions on Mathematics 18, 14–27 (2019)
Abdulaleem, N.: \(E\)-\(B\)-invexity in \(E\)-differentiable mathematical programming. Results in Control and Optimization 4, 100046 (2021)
Bector, C.R., Suneja, S.K., Lalitha, C.S.: Generalized \(B\)-vex functions and generalized \(B\)-vex programming. J. Optim. Theory Appl. 76, 561–576 (1993)
Bector, C.R., Singh, C.: \(B\)-vex functions. J. Optim. Theory Appl. 71, 237–253 (1991)
Bector, C.R., Chandra, S., Gupta, S., Suneja, S.K.: Univex sets, functions and univex nonlinear programming. In: Komlósi, S., Rapcsák, T., Schaible, S. (eds) Generalized Convexity. Lecture Notes in Economics and Mathematical Systems, vol 405. Springer, Berlin, Heidelberg, 3–18 (1994)
Ben-Israel, A., Mond, B.: What is invexity? ANZIAM J. 28(1), 1–9 (1986)
Duca, D.I., Duca, E., Lupsa, L., Blaga, R.: \(E\)-convex functions. Bull. Appl. Comput. Math. 43, 93–103 (2000)
Fulga, C., Preda, V.: Nonlinear programming with \(E\)-preinvex and local \(E\)-preinvex functions. Eur. J. Oper. Res. 192, 737–743 (2009)
Hanson, M.A.: On sufficiency of the Kuhn-Tucker conditions. J. Math. Anal. Appl. 80, 545–550 (1981)
Hanson, M.A., Mond, B.: Further generalizations of convexity in mathematical programming. J. Inf. Optim. Sci. 3, 25–32 (1982)
Hanson, M.A., Mond, B.: Necessary and sufficient conditions in constrained optimization. Math. Program. 37, 51–58 (1987)
Jeyakumar, V., Mond, B.: On generalised convex mathematical programming. ANZIAM J. 34, 43–53 (1992)
Jayswal, A.: Non-differentiable minimax fractional programming with generalized \(\alpha \)-univexity. J. Comput. Appl. Math. 214(1), 121–135 (2008)
Jayswal, A.: On sufficiency and duality in multiobjective programming problem under generalized \(\alpha \)-type I univexity. J. Global Optim. 46(2), 207–216 (2010)
Jiao, H., Liu, S.: Semilocal \(E\)-preinvexity and its applications in nonlinear multiple objective fractional programming. J. Inequal. Appl. 2011, 1–13 (2011)
Kumari, B., Jayswal, A.: Some properties of geodesic \(E\)-preinvex function and geodesic semi \(E\)-preinvex function on Riemannian manifolds. Opsearch 55(3–4), 807–822 (2018)
Megahed, A.A., Gomma, H.G., Youness, E.A., El-Banna, A.Z.: Optimality conditions of \(E\)-convex programming for an \(E\)-differentiable function. J. Inequal. Appl. 2013, 246 (2013)
Mishra, S.K., Mohapatra, R.N., Youness, E.A.: Some properties of semi \(E\)-\(b\)-vex functions. Appl. Math. Comput. 217, 5525–5530 (2011)
Mishra, S.K., Wang, S.Y., Lai, K.K.: Nondifferentiable multiobjective programming under generalized \(d\)-univexity. European J. Oper. Res. 160(1), 218–226 (2005)
Mangasarian, O.L.: Nonlinear Programming. McGraw-Hill Book Company, New York (1969)
Pini, R., Singh, C.A.: survey of recent [1985-1995] advances in generalized convexity with applications to duality theory and optimality conditions. Optimization 39, 311–360 (1997)
Preda, V., Stancu-Minasian, I., Beldiman, M., Stancu, A.M.: Generalized \(V\)-univexity type-I for multiobjective programming with \(n\)-set functions. J. Global Optim. 44(1), 131 (2009)
Stancu-Minasian, I.M., Stancu, A.M.: Duality for multiple objective fractional programming with generalized type-I univexity. In: Migdalas, A., Sifaleras, A., Georgiadis, C., Papathanasiou, J., Stiakakis, E. (eds) Optimization Theory, Decision Making, and Operations Research Applications. Springer Proceedings in Mathematics & Statistics, vol 31. Springer, New York, NY, 199–209 (2013)
Syau, Y.R., Lee, E.S.: Some properties of \(E\)-convex functions. Appl. Math. Lett. 18, 1074–1080 (2005)
Syau, Y.R., Jia, L., Lee, E.S.: Generalizations of \(E\)-convex and \(B\)-vex functions. Comput. Math. Appl. 58, 711–716 (2009)
Suneja, S.K., Singh, C., Bector, C.R.: Generalization of preinvex and \(B\)-vex functions. J. Optim. Theory Appl. 76(3), 577–587 (1993)
Youness, E.A.: \(E\)-convex sets, \(E\)-convex functions, and \(E\)-convex programming. J. Optim. Theory Appl. 102, 439–450 (1999)
Yang, X.M.: On \(E\)-convex sets, \(E\)-convex functions and \(E\)-convex programming. J. Optim. Theory Appl. 109, 699–704 (2001)
Funding
Not applicable.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The author declares to have no competing interests.
Code availability
Not applicable.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Abdulaleem, N. E-Univex Sets, E-Univex Functions and E-Differentiable E-Univex Programming. Results Math 78, 3 (2023). https://doi.org/10.1007/s00025-022-01775-5
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s00025-022-01775-5