E-Convex Sets, E-Convex Functions, and E-Convex Programming

E. A. Youness
Additional contact information
E. A. Youness: Tanta University

Journal of Optimization Theory and Applications, 1999, vol. 102, issue 2, No 13, 439-450

Abstract: Abstract A class of sets and a class of functions called E-convex sets and E-convex functions are introduced by relaxing the definitions of convex sets and convex functions. This kind of generalized convexity is based on the effect of an operator E on the sets and domain of definition of the functions. The optimality results for E-convex programming problems are established.

Keywords: Convex sets; convex functions; generalized convexity; convex programming (search for similar items in EconPapers)
Date: 1999
References: Add references at CitEc
Citations: View citations in EconPapers (11)

Downloads: (external link)
http://link.springer.com/10.1023/A:1021792726715 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joptap:v:102:y:1999:i:2:d:10.1023_a:1021792726715

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1023/A:1021792726715

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().