Sufficient and necessary conditions of optimal solutions of semi-infinite convex programing

2017 International Conference on Grey Systems and Intelligent Services (GSIS) Pub Date : 2017-08-01 DOI:10.1109/GSIS.2017.8077724

Changwen Zhang

引用次数: 0

Abstract

This paper investigates characterizations of semiinfinite convex programming, and obtains conditions of optimal solutions of semi-infinite convex programming by using saddle point criteria.

查看原文本刊更多论文

半无限凸规划最优解的充要条件

研究了半无限凸规划的一些性质，利用鞍点准则得到了半无限凸规划最优解的条件。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

2017 International Conference on Grey Systems and Intelligent Services (GSIS)

自引率

0.00%

发文量