...
首页> 外文期刊>Minimax theory and its applications >Approximate Solutions to Nonsmooth Multiobjective Programming Problems
【24h】

Approximate Solutions to Nonsmooth Multiobjective Programming Problems

机译:Approximate Solutions to Nonsmooth Multiobjective Programming Problems

获取原文
获取原文并翻译 | 示例
           

摘要

We consider a multiobjective mathematical programming problem with inequality and equality constraints, where all functions are locally Lipschitz. An approximate strong Karush-Kuhn-Tucker (ASKKT for short) condition is defined and we show that every local efficient solution is an ASKKT point without any additional condition. Then a nonsmooth version of cone-continuity regularity is defined for this kind of problem. It is revealed that every ASKKT point under the cone-continuity regularity is a strong Karush-Kuhn-Tucker (SKKT for short) point. Correspondingly, the ASKKTs and the cone-continuity property are defined and the relations between them are investigated.
机译:我们认为一个多目标的数学平等不平等和编程问题约束,所有的功能都在本地李普希茨。Karush-Kuhn-Tucker(简称ASKKT)条件定义,我们表明,每个地方的效率没有任何额外的解决方案是一个ASKKT点条件。cone-continuity规律定义类型的问题。cone-continuity规律下一个点强Karush-Kuhn-Tucker(简称SKKT)点。相应地,ASKKTs和cone-continuity属性和定义他们之间的关系进行了研究。

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号