On the reduction of nonconvex problems of generalized semi-infinite mathematical programming to convex problems of semi-infinite programming

被引：0

作者：

Levitin, ES ^{[1
]}

机构：

[1] Russian Acad Sci, Inst Syst Anal, Moscow, Russia

来源：

AUTOMATION AND REMOTE CONTROL | 1998年 / 59卷 / 01期

关键词：

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

We consider the problem of minimizing a nonconvex function of parametric maximum with bound variables over a convex set. It is assumed that the duality relation for this function is valid for all valves of the parameter. Various situations are studied, where the search for an approximate global minimum in the problem under consideration can be reduced (using the branch and bound algorithm) to solving a finite number of convex problems of semi-infinite programming.

引用

页码：22 / 27

页数：6