Scalarizations and optimality of constrained set-valued optimization using improvement sets and image space analysis (Q2278887)

By using improvement sets, some convexity and optimality concepts are generalized to set-valued optimization problems. Subsequently, some scalarization results are established in the sense of optimal solutions defined by the improvement set. Simultaneously, two kinds of separation functions are employed to derive some optimality conditions in the form of a separation between suitable sets in the image space, and saddle point conditions.