Pointwise well-posedness in set optimization with cone proper sets

This paper deals with the well-posedness property in the setting of set optimization problems. By using a notion of well-posed set optimization problem and a scalarization process, we characterize this property through the wellposedness, in the Tykhonov sense, of a family of scalar optimization problems and we show that certain quasiconvex set optimization problems are well-posed. Our approach is based just on a weak boundedness assumption, called cone properness, that is unavoidable to obtain a meaningful set optimization problem.