Global solution of semi-infinite programs

被引：0
|
作者：
Barton, PI [1 ]
Bhattacharjee, B [1 ]
Green, WH [1 ]
机构：
[1] MIT, Dept Chem Engn, Cambridge, MA 02139 USA
来源：
EUROPEAN SYMPOSIUM ON COMPUTER-AIDED PROCESS ENGINEERING - 14 | 2004年 / 18卷
关键词：
semi-infinite programming; branch-and-bound; interval analysis;
D O I：
暂无
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
A branch-and-bound procedure for the global solution of smooth, nonlinear SIPs has been developed. An upper-bounding problem is constructed using an inclusion-constrained reformulation of the infinite set of constraints, and a convex lower-bounding problem is derived from a discretized approximation of the SIP. Results are provided for a number of problems in the SIP literature.
引用
收藏
页码：571 / 576
页数：6
相关论文
共 50 条
12345