...
首页> 外文期刊>Numerical Functional Analysis and Optimization >Optimality Conditions and Duality for Semi-Infinite Mathematical Programming Problem with Equilibrium Constraints
【24h】

Optimality Conditions and Duality for Semi-Infinite Mathematical Programming Problem with Equilibrium Constraints

机译:带有平衡约束的半无限数学规划问题的最优性条件和对偶

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

摘要

This article considers a semi-infinite mathematical programming problem with equilibrium constraints (SIMPEC) defined as a semi-infinite mathematical programming problem with complementarity constraints. We establish necessary and sufficient optimality conditions for the (SIMPEC). We also formulate Wolfe- and Mond-Weir-type dual models for (SIMPEC) and establish weak, strong and strict converse duality theorems for (SIMPEC) and the corresponding dual problems under invexity assumptions.
机译:本文将具有平衡约束的半无限数学规划问题(SIMPEC)定义为具有互补性约束的半无限数学规划问题。我们为(SIMPEC)建立了必要和充分的最优条件。我们还为(SIMPEC)制定了Wolfe型和Mond-Weir型对偶模型,并在凸性假设下建立了(SIMPEC)的弱,强和严格逆对偶定理和相应的对偶问题。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号