Robustness optimization for constrained nonlinear programming problems

被引:52
|
作者
Das, I [1 ]
机构
[1] Mobil Strateg Res Ctr, Dallas, TX 75244 USA
关键词
stochastic optimization; expectation; minimization; constrained optimization; robust design;
D O I
10.1080/03052150008941314
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
In realistic situations engineering designs should take into consideration random aberrations from the stipulated design variables arising from manufacturing variability. Moreover, many environmental parameters are often stochastic in nature. Traditional nonlinear optimization attempts to find a deterministic optimum of a cost function and does not take into account the effect of these random variations on the objective. This paper attempts to devise a technique for finding optima of constrained nonlinear functions that are robust with respect to such variations. The expectation of the function over a domain of aberrations in the parameters is taken as a measure of 'robustness' of the function value at a point. It is pointed out that robustness optimization is ideally an attempt to trade off between 'optimality' and 'robustness'. A newly-developed multicriteria optimization technique known as Normal-Boundary Intersection is used to find evenly-spaced points on the Pareto curve for the 'optimality' and 'robustness' criteria. This Pareto curve enables the user to make the trade-off decision explicitly, free of arbitrary 'weighting' parameters. This paper also formulates a derivative-based approximation for evaluating the expected value of the objective function on the nonlinear manifold defined by the state equations for the system. Existing procedures for evaluating the expectation usually involve numerical integration techniques requiring many solutions of the state equations for one evaluation of the expectation. The procedure presented here bypasses the need for multiple solutions of the state equations and hence provides a cheaper and more easily optimizable approximation to the expectation. Finally, this paper discusses how nonlinear inequality constraints should be treated in the presence of random parameters in the design. Computational results are presented for finding a robust optimum of a nonlinear structural optimization problem.
引用
收藏
页码:585 / 618
页数:34
相关论文
共 50 条
  • [31] Hybrid social cognitive optimization algorithm for constrained nonlinear programming
    SUN Jiaze GENG Guohua WANG Shuyan ZHOU Mingquan School of Information Science and Technology Northwest University Xi an China School of Computer Science and Technology Xi an University of Posts and Telecommunications Xi an China
    The Journal of China Universities of Posts and Telecommunications, 2012, 19 (03) : 91 - 99
  • [32] Noisy Immune Optimization for Chance-constrained Programming Problems
    Zhang Zhu-hong
    MEASURING TECHNOLOGY AND MECHATRONICS AUTOMATION, PTS 1 AND 2, 2011, 48-49 : 740 - 744
  • [33] Inverse optimization for linearly constrained convex separable programming problems
    Zhang, Jianzhong
    Xu, Chengxian
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 200 (03) : 671 - 679
  • [34] On the solution of equality constrained quadratic programming problems arising in optimization
    Gould, NIM
    Hribar, ME
    Nocedal, J
    SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2001, 23 (04): : 1375 - 1394
  • [35] A new neural network for nonlinear constrained optimization problems
    Meng, ZQ
    Dang, CY
    Zhou, GG
    Zhu, YH
    Jiang, M
    ADVANCES IN NEURAL NETWORKS - ISNN 2004, PT 1, 2004, 3173 : 406 - 412
  • [36] A new macroevolutionary algorithm for nonlinear constrained optimization problems
    Zhang, Jihui
    Xu, Junqin
    Song, Xiaoli
    WCICA 2006: SIXTH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-12, CONFERENCE PROCEEDINGS, 2006, : 3291 - +
  • [37] Smoothing nonlinear penalty functions for constrained optimization problems
    Yang, XQ
    Meng, ZQ
    Huang, XX
    Pong, GTY
    NUMERICAL FUNCTIONAL ANALYSIS AND OPTIMIZATION, 2003, 24 (3-4) : 351 - 364
  • [38] DECOMPOSITION OF NONLINEAR CHANCE-CONSTRAINED PROGRAMMING-PROBLEMS BY DYNAMIC-PROGRAMMING
    MINE, H
    OHNO, K
    FUKUSHIMA, M
    JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 1976, 56 (01) : 211 - 222
  • [39] Optimization Methods for Box-Constrained Nonlinear Programming Problems Based on Linear Transformation and Lagrange Interpolating Polynomials
    Wu Z.-Y.
    Bai F.-S.
    Tian J.
    Journal of the Operations Research Society of China, 2017, 5 (2) : 193 - 218
  • [40] OPTIMIZATION ALGORITHMS FOR A CLASS OF NONLINEAR-PROGRAMMING PROBLEMS
    CHOWDHURY, S
    BREUER, MA
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1988, 15 (03) : 175 - 184