<p>The aim is to give the idea of weak minimal solution for set optimization problems based on improvement sets. For set optimization problems involving nearly <i>E</i>-convexlike maps where <i>E</i> is an improvement set, we give Lagrangian multiplier rule, Lagrangian duality results and saddle point conditions. We also present an application of the derived results in the case of an interval-valued problem.</p>

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

Lagrangian Duality in Set Optimization Problems based on Improvement Sets

  • Biswajit Tahu,
  • Jitendra Singh,
  • Pankaj Kumar Garg,
  • Mansi Dhingra

摘要

The aim is to give the idea of weak minimal solution for set optimization problems based on improvement sets. For set optimization problems involving nearly E-convexlike maps where E is an improvement set, we give Lagrangian multiplier rule, Lagrangian duality results and saddle point conditions. We also present an application of the derived results in the case of an interval-valued problem.