This paper adresses the robust counterparts of optimization problems containing sums of maxima of linear functions and proposes several reformulations. These problems include many practical problems, e.g. problems with sums of absolute values, and arise when taking the robust counterpart of a...

Abstract: This paper determines the optimal timing of dike heightenings as well as the corresponding optimal dike heightenings to protect against floods. To derive the optimal policy we design an algorithm based on the Impulse Control Maximum Principle. In this way the paper presents one of the...

In this paper, a general method is described to determine uncertainty intervals for performance measures of Markov chains given an uncertainty region for the parameters of the Markov chains. We investigate the effects of uncertainties in the transition probabilities on the limiting...

AMS classifications: 65D05; 65K05; 90C22;

Abstract This article presents a novel combination of robust optimization developed in mathematical programming, and robust parameter design developed in statistical quality control. Robust parameter design uses metamodels estimated from experiments with both controllable and environmental...

During metamodel-based optimization three types of implicit errors are typically made.The first error is the simulation-model error, which is defined by the difference between reality and the computer model.The second error is the metamodel error, which is defined by the difference between the...

We review complexity results for minimizing polynomials over the standard simplex and unit hypercube.In addition, we show that there exists a polynomial time approximation scheme (PTAS) for minimizing Lipschitz continuous functions and functions with uniformly bounded Hessians over the standard...

We show that the robust counterpart of a convex quadratic constraint with ellipsoidal implementation error is equivalent to a system of conic quadratic constraints. To prove this result we first derive a sharper result for the S-lemma in case the two matrices involved can be simultaneously...

This paper advocates the use of methods based on global approximation models for optimization problems with time-consuming function evaluations and integer variables.We show that methods based on local approximations may lead to the integer rounding of the optimal solution of the continuous...

In many fields, we come across problems where we want to optimize several conflicting objectives simultaneously. To find a good solution for such multi-objective optimization problems, an approximation of the Pareto set is often generated. In this paper, we con- sider the approximation of Pareto...