On the Hadamard well-posedness of set optimization problems: two new results
摘要
In this paper, we introduce two novel concepts of well-posedness for set optimization problems and present some results in this area. The first main result improves a recent finding in the field without employing the scalarization method. The second one establishes a new form of well-posedness for set optimization problems using a recently introduced scalarization function. To clarify our findings, we also provide corollaries and examples.