Scholarlink

<p>In this paper, we consider set optimization problems whose solution concepts are defined by means of set less order relations involving Minkwoski difference. We propose well-posedness and generalized well-posedness for set optimization problems, and derive sufficient and necessary conditions for these well-posedness. A relation between well-posedness and generalized well-posedness for set optimization problems is also given. We use a nonlinear scalarization method to establish necessary and sufficient conditions for the well-posedness and generalized well-posedness of set optimization problems. Several examples are given to illustrate our results.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Well-Posedness of Set Optimization Problems with Set Order Defined by Minkowski Difference

  • 期刊论文

  • 发表日期：

    2025年1月21日

查看全文
  • Zhiang Zhou,
  • Kehao Feng,
  • Qamrul Hasan Ansari

摘要

In this paper, we consider set optimization problems whose solution concepts are defined by means of set less order relations involving Minkwoski difference. We propose well-posedness and generalized well-posedness for set optimization problems, and derive sufficient and necessary conditions for these well-posedness. A relation between well-posedness and generalized well-posedness for set optimization problems is also given. We use a nonlinear scalarization method to establish necessary and sufficient conditions for the well-posedness and generalized well-posedness of set optimization problems. Several examples are given to illustrate our results.