| Article ID: | iaor2006610 |
| Country: | Belarus |
| Volume: | 2 |
| Start Page Number: | 102 |
| End Page Number: | 106 |
| Publication Date: | Jun 2004 |
| Journal: | Mathematical Sciences |
| Authors: | Naidenko V.G. |
| Keywords: | Programming (convex) |
The generalized convexity (OC-convexity) which consists of the intersections of conic semispaces of directional convexity is investigated. The optimization problem on an OC-convex set is considered. The theorem of Krein–Milman type for OC-convexity has been proven in case of the vector set of directional convexity being infinite. The relation between OC-convex and functionally convex sets is considered.