NUMERICAL FUNCTIONAL ANALYSIS AND OPTIMIZATION, cilt.27, sa.3-4, ss.237-257, 2006 (SCI-Expanded)
A subset B of R-+(n) is B-convex if for all x, y is an element of B and all t is an element of [0, 1] one has max (tx, y) is an element of B. These sets were first investigated in [1, 2]. In this paper, we examine radiant B-convex sets and also introduce and study B-convex functions.