Paperlane

no. 17 · Wednesday 18 November 2026

Decision-Weighted Limit Theorems: Less Conservative Robust Optimization

Dimitris Bertsimas, Danique de Moor, Dick den Hertog and Federica Donnini

math.OC

Abstract

Limit theorems provide a natural way to construct tractable models for optimization under uncertainty. Existing approaches typically apply them to unweighted sums of uncertain parameters and use the resulting bounds to construct uncertainty sets. We show that sharper formulations are obtained by applying limit theorems directly to the uncertain linear expressions in the optimization problem, with the decision variables as weights. For independent random variables with finite variance, the weighted central limit theorem yields a second-order cone constraint with a decision-dependent protection term, and for heavy-tailed random variables governed by stable limit laws, the weighted approach yields power-cone constraints. Using norm duality, we show that, under a condition on the individual bounds, the feasible region of the unweighted formulation is contained in that of the weighted one. In 16,000 knapsack instances with a prescribed violation probability of 5%, the weighted formulation improves the optimal objective value by 20.9% on average, with overall average violation probabilities between 3.45% and 4.95%, whereas those of the unweighted formulation are near zero.

fields
Optimization and Control
pdf ↗ page arXiv:2611.21944 ↗