Trade-off studies in blackbox optimization

摘要: This paper proposes a framework for trade-off analyses of blackbox constrained optimization problems. Two strategies are developed to show the optimal objective function value with tightening or loosening general constraints. These simple method which may be performed immediately after single and detailed performing biobjective on minimization versus constraint interest. The provides points Pareto front, curve, chosen constraint. near all designer needs. information is generally used by engineers rather than first-order sensitivity estimates provided Lagrange multipliers, only provide tangent front at solution found. proposed methods tested an academic test case engineering problem using mesh-adaptive direct search algorithm.