...
首页> 外文期刊>Journal of Mathematical Analysis and Applications >An eta-approximation approach to duality in mathematical programming problems involving r-invex functions
【24h】

An eta-approximation approach to duality in mathematical programming problems involving r-invex functions

机译:涉及r-invex函数的数学编程问题中对偶性的eta逼近方法

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

摘要

An eta-approximation approach introduced by Antczak [T. Antczak, A new method of solving nonlinear mathematical programming problems involving r-invex functions, J. Math. Anal. Appl. 311 (2005) 313-323] is used to obtain a Solution Mond-Weir dual problems involving r-invex functions. eta-Approxiniated Mond-Weir dual problems are introduced for the eta-approximated optimization problem constructed in this method associated with the original nonlinear mathematical programming problem. By the help of eta-approximated dual problems various duality results are established for the original mathematical programming problem and its original Mond-Weir duals. (c) 2005 Published by Elsevier Inc.
机译:Antczak [T. Antczak,一种解决涉及r-invex函数的非线性数学规划问题的新方法,J。Math。肛门应用[311(2005)313-323]用于获得涉及r-invex函数的Solution Mond-Weir对偶问题。针对该方法中与原始非线性数学规划问题相关联的近似η优化问题,引入了近似ηMond-Weir对偶问题。借助eta逼近对偶问题,可以为原始数学编程问题及其原始Mond-Weir对偶建立各种对偶结果。 (c)2005年由Elsevier Inc.发布。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号