An algorithm for constrained nonlinear optimization under uncertainty

被引:50
|
作者
Darlington, J
Pantelides, CC
Rustem, B
Tanyi, BA
机构
[1] Univ London Imperial Coll Sci Technol & Med, Dept Comp, London SW7 2BZ, England
[2] Univ London Imperial Coll Sci Technol & Med, Ctr Proc Syst Engn, London SW7, England
基金
英国工程与自然科学研究理事会;
关键词
uncertainty; robust optimization; risk management; mean-variance analysis; nonlinear programming; sequential quadratic programming; Goldstein-Levitin-Polyak algorithm;
D O I
10.1016/S0005-1098(98)00150-2
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper considers robust formulations for the constrained control of systems under uncertainty. The underlying model is nonlinear and stochastic. A mean-variance robustness framework is adopted. We consider formulations to ensure feasibility over the entire domain of the uncertain parameters. However, strict Feasibility may not always be possible, and can also be very expensive. We consider two alternative approaches to address feasibility. Flexibility in the operational conditions is provided via a penalty framework. The robust strategies are rested on a dynamic optimization problem arising from a chemical engineering application. (C) 1999 Elsevier Science Ltd. All rights reserved.
引用
收藏
页码:217 / 228
页数:12
相关论文
共 50 条