Data-driven distributionally robust optimization using the Wasserstein metric: Performance guarantees and tractable reformulations
We consider stochastic programs where the distribution of the uncertain parameters is only
observable through a finite training dataset. Using the Wasserstein metric, we construct a …
observable through a finite training dataset. Using the Wasserstein metric, we construct a …
A distributionally robust perspective on uncertainty quantification and chance constrained programming
The objective of uncertainty quantification is to certify that a given physical, engineering or
economic system satisfies multiple safety conditions with high probability. A more ambitious …
economic system satisfies multiple safety conditions with high probability. A more ambitious …
Ambiguous joint chance constraints under mean and dispersion information
We study joint chance constraints where the distribution of the uncertain parameters is only
known to belong to an ambiguity set characterized by the mean and support of the …
known to belong to an ambiguity set characterized by the mean and support of the …
Identifying effective scenarios in distributionally robust stochastic programs with total variation distance
Traditional stochastic programs assume that the probability distribution of uncertainty is
known. However, in practice, the probability distribution oftentimes is not known or cannot be …
known. However, in practice, the probability distribution oftentimes is not known or cannot be …
Computationally tractable counterparts of distributionally robust constraints on risk measures
In optimization problems appearing in fields such as economics, finance, or engineering, it is
often important that a risk measure of a decision-dependent random variable stays below a …
often important that a risk measure of a decision-dependent random variable stays below a …
Data-driven optimization of reward-risk ratio measures
We investigate a class of fractional distributionally robust optimization problems with
uncertain probabilities. They consist in the maximization of ambiguous fractional functions …
uncertain probabilities. They consist in the maximization of ambiguous fractional functions …
Novel integer L-shaped method for parallel machine scheduling problem under uncertain sequence-dependent setups
We study scheduling problems on unrelated parallel machines with uncertainty in job
processing and sequence-dependent setup times. We first formulate this problem as a two …
processing and sequence-dependent setup times. We first formulate this problem as a two …
On the risk levels of distributionally robust chance constrained problems
Chance constraints ensure the satisfaction of constraints under uncertainty with a desired
probability. This scheme is unfortunately sensitive to assumptions of the probability …
probability. This scheme is unfortunately sensitive to assumptions of the probability …
A decomposition algorithm for distributionally robust chance-constrained programs with polyhedral ambiguity set
In this paper, we study a distributionally robust optimization approach to chance-constrained
stochastic programs to hedge against uncertainty in the distributions of the random …
stochastic programs to hedge against uncertainty in the distributions of the random …