期刊
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS
卷 173, 期 2, 页码 683-703出版社
SPRINGER/PLENUM PUBLISHERS
DOI: 10.1007/s10957-017-1069-4
关键词
Bilevel programming; Robust optimization; Uncertain linear constraints; Global polynomial optimization; Semidefinite program
资金
- UNSW Vice-Chancellor's Postdoctoral Research Fellowship [RG134608/SIR50]
- Australian Research Council
This paper studies a bilevel polynomial program involving box data uncertainties in both its linear constraint set and its lower-level optimization problem. We show that the robust global optimal value of the uncertain bilevel polynomial program is the limit of a sequence of values of Lasserre-type hierarchy of semidefinite linear programming relaxations. This is done by first transforming the uncertain bilevel polynomial program into a single-level non-convex polynomial program using a dual characterization of the solution of the lower-level program and then employing the powerful Putinar's Positivstellensatz of semi-algebraic geometry. We provide a numerical example to show how the robust global optimal value of the uncertain bilevel polynomial program can be calculated by solving a semidefinite programming problem using the MATLAB toolbox YALMIP.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据