Optimization on directionally convex sets
Directional convexity generalizes the concept of classical convexity. We investigate OC-convexity generated by the intersections of C-semispaces that efficiently approximates directional convexity. We consider the following optimization problem in case of the direction set of OC-convexity being infinite. Given a compact OC-convex set A, maximize a linear form L subject to A. We prove that there exists an OC-extreme solution of the problem. We introduce the notion of OC-quasiconvex function. Ii is shown that if O is finite then the constrained maximum of an OC-quasiconvex function on the set A is attained at an OC-extreme point of A. We show that the OC-convex hull of a finite point set represents the union of a finite set of polytopes in case of the direction set being finite. Copyright Springer-Verlag 2009
Volume (Year): 17 (2009)
Issue (Month): 1 (March)
|Contact details of provider:|| Web page: http://www.springer.com|
Web page: http://www.fhi.sk/ssov
Web page: http://www.mot.org.hu/index_en.html
Web page: http://nb.vse.cz/csov/english.htm
Web page: http://www.oegor.at/
Web page: http://hdoi.hr/en_US/en/
|Order Information:||Web: http://www.springer.com/business/operations+research/journal/10100|
When requesting a correction, please mention this item's handle: RePEc:spr:cejnor:v:17:y:2009:i:1:p:55-63. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla)or (Rebekah McClure)
If references are entirely missing, you can add them using this form.