首页> 外文期刊>Optimization: A Journal of Mathematical Programming and Operations Research >A simple approach to optimality conditions in minmax programming
【24h】

A simple approach to optimality conditions in minmax programming

机译:minmax编程中求最佳条件的一种简单方法

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

摘要

Considering the minmax programming problem, lower and upper subdifferential optimality conditions, in the sense of Mordukhovich, are derived. The approach here, mainly based on the nonsmooth dual objects of Mordukhovich, is completely different from that of most of the previous works where generalizations of the alternative theorem of Farkas have been applied. The results obtained are close to those known in the literature. However, one of the main achievements of this article is that we could also derive necessary optimality conditions for the minmax program of the usual Karush-Kuhn-Tucker type, which seems to be new in this field of study.
机译:考虑到最小极大规划问题,从Mordukhovich的角度出发,推导了上下次微分最优性条件。这里的方法主要基于Mordukhovich的非光滑对偶,与以前的大多数方法(其中应用了Farkas的替代定理的推广)完全不同。获得的结果接近文献中已知的结果。但是,本文的主要成就之一是,我们还可以为通常的Karush-Kuhn-Tucker类型的minmax程序得出必要的最优性条件,这在该研究领域中似乎是新的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号