Optimality conditions and minimax properties in set optimization

In this paper, we consider a generalization of the Gerstewitz’s function to present several optimality conditions and existence theorems for a set optimization problem without convexity assumptions. A characterization of set solutions for a set-valued optimization problem is given via minimax inequalities.