首页> 外文期刊>Journal of Optimization Theory and Applications >Constraint Qualifications and Stationary Conditions for Mathematical Programming with Non-differentiable Vanishing Constraints
【24h】

Constraint Qualifications and Stationary Conditions for Mathematical Programming with Non-differentiable Vanishing Constraints

机译:数学规划的约束资格和静止条件,具有非可分辨性消失约束的数学规划

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

摘要

This paper aims at studying a broad class of mathematical programming with non-differentiable vanishing constraints. First, we are interested in some various qualification conditions for the problem. Then, these constraint qualifications are applied to obtain, under different conditions, several stationary conditions of type Karush/Kuhn-Tucker.
机译:本文旨在研究一类具有不可微消失约束的数学规划问题。首先,我们对该问题的各种资格条件感兴趣。然后,应用这些约束条件,在不同的条件下,获得Karush/Kuhn-Tucker型的几个平稳条件。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号