Nonlinear programming with E-preinvex and local E-preinvex functions
In this paper, we extend the class of E-convex sets, E-convex and E-quasiconvex functions introduced by [Youness, E.A., 1999. E-convex sets, E-convex functions and E-convex programming. Journal of Optimization Theory and Applications 102, 439-450], respectively by [Syau, Yu-Ru, Lee, E. Stanley, 2005. Some properties of E-convex functions. Applied Mathematics Letters 18, 1074-1080] to E-invex set, E-preinvex, E-prequasiinvex and corresponding local concepts. Some properties of these classes are studied. As an application of our results, we consider the nonlinear programming problem for which, we establish that, under mild conditions, a local minimum is a global minimum.
Year of publication: |
2009
|
---|---|
Authors: | Fulga, C. ; Preda, V. |
Published in: |
European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 192.2009, 3, p. 737-743
|
Publisher: |
Elsevier |
Subject: | (T) Nonlinear programming E-invexity E-preinvexity |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Nonlinear programming with E-preinvex and local E-preinvex functions
Fulga, C., (2009)
-
Bounds for Jeffreys–Tsallis and Jensen–Shannon–Tsallis divergences
Popescu, P.G., (2014)
- More ...