Efficient infill sampling for unconstrained robust optimization problems

2015 ◽  
Vol 48 (8) ◽  
pp. 1313-1332 ◽  
Author(s):  
Samee Ur Rehman ◽  
Matthijs Langelaar
Keyword(s):  
Robust Optimization ◽  
Optimization Problems ◽  
Infill Sampling

scholarly journals The trouble with the second quantifier

4OR ◽  
2021 ◽  
Author(s):  
Gerhard J. Woeginger
Keyword(s):  
Computational Complexity ◽  
Robust Optimization ◽  
Complexity Theory ◽  
Operational Research ◽  
Optimization Problems ◽  
Bilevel Optimization ◽  
Theoretical Background ◽  
Research Community ◽  
Universal Quantifier ◽  
Computational Complexity Theory

AbstractWe survey optimization problems that allow natural simple formulations with one existential and one universal quantifier. We summarize the theoretical background from computational complexity theory, and we present a multitude of illustrating examples. We discuss the connections to robust optimization and to bilevel optimization, and we explain the reasons why the operational research community should be interested in the theoretical aspects of this area.

scholarly journals Oracle-based algorithms for binary two-stage robust optimization

2020 ◽  
Vol 77 (2) ◽  
pp. 539-569
Author(s):  
Nicolas Kämmerling ◽  
Jannis Kurtz
Keyword(s):  
Robust Optimization ◽  
Branch And Bound ◽  
Optimization Problems ◽  
Capital Budgeting ◽  
Hub Location Problem ◽  
Two Stage ◽  
Generation Algorithm ◽  
Constraint Generation ◽  
Deterministic Problem ◽  
Objective Uncertainty

Abstract In this work we study binary two-stage robust optimization problems with objective uncertainty. We present an algorithm to calculate efficiently lower bounds for the binary two-stage robust problem by solving alternately the underlying deterministic problem and an adversarial problem. For the deterministic problem any oracle can be used which returns an optimal solution for every possible scenario. We show that the latter lower bound can be implemented in a branch and bound procedure, where the branching is performed only over the first-stage decision variables. All results even hold for non-linear objective functions which are concave in the uncertain parameters. As an alternative solution method we apply a column-and-constraint generation algorithm to the binary two-stage robust problem with objective uncertainty. We test both algorithms on benchmark instances of the uncapacitated single-allocation hub-location problem and of the capital budgeting problem. Our results show that the branch and bound procedure outperforms the column-and-constraint generation algorithm.

Linearized Robust Counterparts of Two-Stage Robust Optimization Problems with Applications in Operations Management

2020 ◽  
Author(s):  
Amir Ardestani-Jaafari ◽  
Erick Delage
Keyword(s):  
Robust Optimization ◽  
Operations Management ◽  
Optimization Problems ◽  
Close Relation ◽  
Bilinear Programming ◽  
Two Stage ◽  
Bilinear Models ◽  
Robust Counterpart ◽  
Adjustable Robust Counterpart ◽  
Affinely Adjustable Robust Counterpart

In this article, we discuss an alternative method for deriving conservative approximation models for two-stage robust optimization problems. The method mainly relies on a linearization scheme employed in bilinear programming; therefore, we will say that it gives rise to the linearized robust counterpart models. We identify a close relation between this linearized robust counterpart model and the popular affinely adjustable robust counterpart model. We also describe methods of modifying both types of models to make these approximations less conservative. These methods are heavily inspired by the use of valid linear and conic inequalities in the linearization process for bilinear models. We finally demonstrate how to employ this new scheme in location-transportation and multi-item newsvendor problems to improve the numerical efficiency and performance guarantees of robust optimization.

A Unified Approach to Robust Farkas-Type Results with Applications to Robust Optimization Problems

2017 ◽  
Vol 27 (2) ◽  
pp. 1075-1101 ◽  
Author(s):  
N. Dinh ◽  
T. H. Mo ◽  
G. Vallet ◽  
M. Volle
Keyword(s):  
Robust Optimization ◽  
Optimization Problems ◽  
Unified Approach

Toward the Use of Pareto Performance Solutions and Pareto Robustness Solutions for Multi-Objective Robust Optimization Problems

2012 ◽  
Author(s):  
Weijun Wang ◽  
Stéphane Caro ◽  
Fouad Bennis ◽  
Oscar Brito Augusto
Keyword(s):  
Robust Optimization ◽  
Pareto Front ◽  
Optimization Problem ◽  
Optimization Problems ◽  
Multi Objective Optimization ◽  
Robust Solutions ◽  
Multi Objective ◽  
Robust Optimization Problem ◽  
Design Solutions ◽  
Further Development

For Multi-Objective Robust Optimization Problem (MOROP), it is important to obtain design solutions that are both optimal and robust. To find these solutions, usually, the designer need to set a threshold of the variation of Performance Functions (PFs) before optimization, or add the effects of uncertainties on the original PFs to generate a new Pareto robust front. In this paper, we divide a MOROP into two Multi-Objective Optimization Problems (MOOPs). One is the original MOOP, another one is that we take the Robustness Functions (RFs), robust counterparts of the original PFs, as optimization objectives. After solving these two MOOPs separately, two sets of solutions come out, namely the Pareto Performance Solutions (PP) and the Pareto Robustness Solutions (PR). Make a further development on these two sets, we can get two types of solutions, namely the Pareto Robustness Solutions among the Pareto Performance Solutions (PR(PP)), and the Pareto Performance Solutions among the Pareto Robustness Solutions (PP(PR)). Further more, the intersection of PR(PP) and PP(PR) can represent the intersection of PR and PP well. Then the designer can choose good solutions by comparing the results of PR(PP) and PP(PR). Thanks to this method, we can find out the optimal and robust solutions without setting the threshold of the variation of PFs nor losing the initial Pareto front. Finally, an illustrative example highlights the contributions of the paper.

scholarly journals Multi-Objective Robust Optimization Using a Postoptimality Sensitivity Analysis Technique: Application to a Wind Turbine Design

2015 ◽  
Vol 137 (1) ◽  
Author(s):  
Weijun Wang ◽  
Stéphane Caro ◽  
Fouad Bennis ◽  
Ricardo Soto ◽  
Broderick Crawford
Keyword(s):  
Sensitivity Analysis ◽  
Robust Optimization ◽  
Wind Turbine ◽  
Optimization Design ◽  
Optimization Problems ◽  
Design Environment ◽  
Multi Objective ◽  
Pareto Ranking ◽  
Analysis Technique ◽  
Robust Optimization Design

Toward a multi-objective optimization robust problem, the variations in design variables (DVs) and design environment parameters (DEPs) include the small variations and the large variations. The former have small effect on the performance functions and/or the constraints, and the latter refer to the ones that have large effect on the performance functions and/or the constraints. The robustness of performance functions is discussed in this paper. A postoptimality sensitivity analysis technique for multi-objective robust optimization problems (MOROPs) is discussed, and two robustness indices (RIs) are introduced. The first one considers the robustness of the performance functions to small variations in the DVs and the DEPs. The second RI characterizes the robustness of the performance functions to large variations in the DEPs. It is based on the ability of a solution to maintain a good Pareto ranking for different DEPs due to large variations. The robustness of the solutions is treated as vectors in the robustness function space (RF-Space), which is defined by the two proposed RIs. As a result, the designer can compare the robustness of all Pareto optimal solutions and make a decision. Finally, two illustrative examples are given to highlight the contributions of this paper. The first example is about a numerical problem, whereas the second problem deals with the multi-objective robust optimization design of a floating wind turbine.

Robust Optimization in Possibility Theory

2019 ◽  
Vol 5 (4) ◽  
Author(s):  
Dominik Hose ◽  
Markus Mäck ◽  
Michael Hanss
Keyword(s):  
Decision Making ◽  
Robust Optimization ◽  
Objective Function ◽  
Optimization Problems ◽  
Initial Conditions ◽  
Multicriteria Decision Making ◽  
Possibility Theory ◽  
Linear Quadratic Regulator ◽  
Linear Quadratic ◽  
Multicriteria Decision

Abstract In this contribution, the optimization of systems under uncertainty is considered. The possibilistic evaluation of the fuzzy-valued constraints and the adoption of a multicriteria decision making technique for the fuzzy-valued objective function enable a meaningful solution to general fuzzy-valued optimization problems. The presented approach is universally applicable, which is demonstrated by reformulating and solving the linear quadratic regulator problem for fuzzy-valued system matrices and initial conditions.

Robust Optimization With Mixed Interval and Probabilistic Parameter Uncertainties, Model Uncertainty, and Metamodeling Uncertainty

2019 ◽  
Author(s):  
Yanjun Zhang ◽  
Tingting Xia ◽  
Mian Li
Keyword(s):  
Robust Optimization ◽  
Real World ◽  
Parameter Uncertainty ◽  
Model Uncertainty ◽  
Optimization Problems ◽  
Probability Distributions ◽  
Parameter Uncertainties ◽  
True Value ◽  
Uncertainty Model ◽  
The Difference

Abstract Various types of uncertainties, such as parameter uncertainty, model uncertainty, metamodeling uncertainty may lead to low robustness. Parameter uncertainty can be either epistemic or aleatory in physical systems, which have been widely represented by intervals and probability distributions respectively. Model uncertainty is formally defined as the difference between the true value of the real-world process and the code output of the simulation model at the same value of inputs. Additionally, metamodeling uncertainty is introduced due to the usage of metamodels. To reduce the effects of uncertainties, robust optimization (RO) algorithms have been developed to obtain solutions being not only optimal but also less sensitive to uncertainties. Based on how parameter uncertainty is modeled, there are two categories of RO approaches: interval-based and probability-based. In real-world engineering problems, both interval and probabilistic parameter uncertainties are likely to exist simultaneously in a single problem. However, few works have considered mixed interval and probabilistic parameter uncertainties together with other types of uncertainties. In this work, a general RO framework is proposed to deal with mixed interval and probabilistic parameter uncertainties, model uncertainty, and metamodeling uncertainty simultaneously in design optimization problems using the intervals-of-statistics approaches. The consideration of multiple types of uncertainties will improve the robustness of optimal designs and reduce the risk of inappropriate decision-making, low robustness and low reliability in engineering design. Two test examples are utilized to demonstrate the applicability and effectiveness of the proposed RO approach.

Feasibility Robust Optimization via Scenario Generation and Reduction

2018 ◽  
Author(s):  
Eliot Rudnick-Cohen ◽  
Jeffrey W. Herrmann ◽  
Shapour Azarm
Keyword(s):  
Robust Optimization ◽  
Optimization Problems ◽  
Computational Cost ◽  
Optimization Techniques ◽  
Scenario Generation ◽  
Test Problems ◽  
Optimization Approach ◽  
Uncertain Parameters ◽  
Worst Case ◽  
Robust Solution

Feasibility robust optimization techniques solve optimization problems with uncertain parameters that appear only in their constraint functions. Solving such problems requires finding an optimal solution that is feasible for all realizations of the uncertain parameters. This paper presents a new feasibility robust optimization approach involving uncertain parameters defined on continuous domains without any known probability distributions. The proposed approach integrates a new sampling-based scenario generation scheme with a new scenario reduction approach in order to solve feasibility robust optimization problems. An analysis of the computational cost of the proposed approach was performed to provide worst case bounds on its computational cost. The new proposed approach was applied to three test problems and compared against other scenario-based robust optimization approaches. A test was conducted on one of the test problems to demonstrate that the computational cost of the proposed approach does not significantly increase as additional uncertain parameters are introduced. The results show that the proposed approach converges to a robust solution faster than conventional robust optimization approaches that discretize the uncertain parameters.

Sign in / Sign up

Export Citation Format

Share Document