摘要
Robust optimization is an effective method for dealing with the optimization problems under uncertainty. When there is uncertainty in the lower level optimization problem of a bilevel programming, it can be formulated by a robust optimization method as a bilevel programming problem with lower level second-order cone program (SOCBLP). In this paper, we present the mathematical models of the SOCBLP, and we give some basic concepts, such as constraint region, inducible region, and optimal solution. It is illustrated that the SOCBLP is generally a nonconvex and nondifferentiable optimization problem, whose feasible set may be not connected in some cases and the constraint region is generally not polyhedral. Finally under suitable conditions we propose the optimality conditions for several models of the SOCBLP in the optimistic case.
| 源语言 | 英语 |
|---|---|
| 期刊论文编号 | 168 |
| 页数 | 23 |
| 期刊 | JOURNAL OF INEQUALITIES AND APPLICATIONS |
| DOI | |
| 出版状态 | 已出版 - 6 5月 2014 |
基金资助
This research is supported by the National Natural Science Foundation of China (Nos. 71171150, 11161001, 71161001) and China Postdoctoral Science Foundation of China (No. 2012M511651). The authors are grateful to the editor and the anonymous referees for their valuable comments, which have greatly improved the paper.
关键词
- bilevel programming with lower level second-order cone program
- nondifferentiable
- nonconvex
- feasible set
- optimality conditions
收录
- Scopus
- SCIE
学术指纹
探究 'The models of bilevel programming with lower level second-order cone programs' 的科研主题。它们共同构成独一无二的学术指纹。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver