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.
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Antczak, Tadeusz, 2004. "(p,r)-Invexity in multiobjective programming," European Journal of Operational Research, Elsevier, vol. 152(1), pages 72-87, January.
- Stancu-Minasian, I.M., 2006. "Optimality and duality in nonlinear programming involving semilocally B-preinvex and related functions," European Journal of Operational Research, Elsevier, vol. 173(1), pages 47-58, August.
- Kaul, R. N. & Kaur, Surjeet, 1982. "Generalizations of convex and related functions," European Journal of Operational Research, Elsevier, vol. 9(4), pages 369-377, April.
When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:192:y:2009:i:3:p:737-743. See general information about how to correct material in RePEc.
If references are entirely missing, you can add them using this form.