Unboundedness in Kasimbeyli’sscalarization

Kasimbeyli’sscalarization or conic scalarization is a useful tool for scalarizing which introduce by Kasimbeyli[5,6]. Thisscalarizationis proposed for determining all properly efficient elements in nonconvex vector optimization problem. In this paper, we show that if the Kasimbeyli soptimization problem is unbounded in below then the set of properly efficient points is empty.