# On the Optimality of Affine Policies for Budgeted Uncertainty Sets

@article{Housni2019OnTO,
title={On the Optimality of Affine Policies for Budgeted Uncertainty Sets},
author={Omar El Housni and Vineet Goyal},
journal={arXiv: Optimization and Control},
year={2019}
}
• Published 30 June 2018
• Mathematics
• arXiv: Optimization and Control
In this paper, we study the performance of affine policies for two-stage adjustable robust optimization problem with fixed recourse and uncertain right hand side belonging to a budgeted uncertainty set. This is an important class of uncertainty sets widely used in practice where we can specify a budget on the adversarial deviations of the uncertain parameters from the nominal values to adjust the level of conservatism. The two-stage adjustable robust optimization problem is hard to approximate…

## Tables from this paper

On the Optimality of Affine Decision Rules in Robust and Distributionally Robust Optimization
We propose tight conditions under which two-stage robust and distributionally robust optimization problems are optimally solved in affine decision rules. Contrary to previous work, our conditions do
• 2021
Dynamic robust optimization involves sequential decisions over multiple stages against worst-case uncertainty realizations. At each stage, the decision-maker observes the uncertainty realization
Duality in Adaptive Robust Linear Optimization
• 2019
Adaptive robust optimization is a modelling paradigm for multistage optimization under uncertainty where one seeks decisions that minimize the worst-case cost with respect to all possible scenarios
A Primal-Dual Perspective on Adaptive Robust Linear Optimization
• 2020
Adaptive robust optimization is a modelling paradigm for multistage optimization under uncertainty where one seeks decisions that minimize the worst-case cost with respect to all possible scenarios
Optimal Robust Policy for Feature-Based Newsvendor
• Rui Gao, Jincheng Yang, Luhao Zhang
• 2021
We study policy optimization for the feature-based newsvendor, which seeks an end-to-end policy that renders an explicit mapping from features to ordering decisions. Unlike existing works that
On the Power of Static Assignment Policies for Robust Facility Location Problems
• Computer Science, Mathematics
IPCO
• 2021
In an optimal solution, the second-stage assignment decisions depend on the scenario; surprisingly, it is shown that restricting to a fixed (static) fractional assignment for each potential client irrespective of the scenario gives us an O(\log k/\log \log k)-approximation for the problem.
LP-based Approximations for Disjoint Bilinear and Two-Stage Adjustable Robust Optimization
• Mathematics
• 2021
We consider the class of disjoint bilinear programs max {xT y | x ∈ X , y ∈ Y} where X and Y are packing polytopes. We present an O( log log m1 log m1 log log m2 log m2 )-approximation algorithm for
Disjoint Bilinear Optimization: A Two-stage Robust Optimization Perspective
In this paper, we focus on a subclass of quadratic optimization problems, that is, disjoint bilinear optimization problems. We first show that disjoint bilinear optimization problems can be cast as
Disjoint bilinear programming: a two-stage robust optimization perspective
• Computer Science
• 2018
This paper shows that disjoint bilinear programming problems can be cast as two-stage robust linear optimization problems with fixed-recourse and right-hand-side uncertainty, and techniques for two- stage robust optimization can be used to solve the resulting problems.
Robust location-transportation problems with integer-valued demand
• Computer Science
• 2020
This paper proves two main characteristics of the LT problems, namely convexity and nondecreasingness of the optimal shipment cost function, and proposes a new method, called Simplex-type method, to find a locally robust solution for a general uncertainty set.

## References

SHOWING 1-10 OF 30 REFERENCES
On the power and limitations of affine policies in two-stage adaptive optimization
• Mathematics, Computer Science
Math. Program.
• 2012
It is shown that the worst-case cost of an optimal affine policy can be $${\Omega(m^{1/2-\delta})}$$ times the best- case cost of the optimal fully-adaptable solution for any δ > 0, where m is the number of linear constraints.
On the performance of affine policies for two-stage adaptive optimization: a geometric perspective
• Mathematics, Computer Science
Math. Program.
• 2015
An a priori approximation bound on the ratio of the optimal affine solution to the optimal adjustable solution that depends on two fundamental geometric properties of the uncertainty set U and provides deeper insight on the power of affine policies for this class of problems is provided.
Beyond Worst-case: A Probabilistic Analysis of Affine Policies in Dynamic Optimization
• Computer Science, Mathematics
NIPS
• 2017
It is shown that with high probability affine policies give a good approximation for two-stage dynamic robust optimization problems on random instances generated from a large class of distributions, providing a theoretical justification of the observed empirical performance.
Supermodularity and Affine Policies in Dynamic Robust Optimization
• Mathematics, Computer Science
Oper. Res.
• 2013
If the uncertainty sets are integer sublattices of the unit hypercube, the DP value functions are convex and supermodular in the uncertain parameters, and a certain technical condition is satisfied, then decision rules that are affine in the uncertainty parameters are optimal.
A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides
• Mathematics, Computer Science
Comput. Optim. Appl.
• 2018
It is proved that under standard and simple conditions, the two-stage problem can be reformulated as a copositive optimization problem, which leads to a class of tractable, semidefinite-based approximations that are at least as strong as the affine policy.
Adjustable robust solutions of uncertain linear programs
• Mathematics, Computer Science
Math. Program.
• 2004
The Affinely Adjustable Robust Counterpart (AARC) problem is shown to be, in certain important cases, equivalent to a tractable optimization problem, and in other cases, having a tight approximation which is tractable.
The Price of Robustness
• Computer Science, Mathematics
Oper. Res.
• 2004
An approach is proposed that flexibly adjust the level of conservatism of the robust solutions in terms of probabilistic bounds of constraint violations, and an attractive aspect of this method is that the new robust formulation is also a linear optimization problem, so it naturally extend to discrete optimization problems in a tractable way.
A tractable approach for designing piecewise affine policies in two-stage adjustable robust optimization
• Computer Science, Mathematics
Math. Program.
• 2020
The policy is an approximate piecewise-affine policy and is not necessarily a generalization of the class of affine policies, but the performance is significantly better than the affine policy for many important uncertainty sets, such as ellipsoids and norm-balls, both theoretically and numerically.
A Linear Decision-Based Approximation Approach to Stochastic Programming
• Mathematics, Computer Science
Oper. Res.
• 2008
This paper proposes tractable methods of addressing a general class of multistage stochastic optimization problems, which assume only limited information of the distributions of the underlying uncertainties, such as known mean, support, and covariance, and proposes several new decision rules that improve upon linear decision rules, while keeping the approximate models computationally tractable.
How to pay, come what may: approximation algorithms for demand-robust covering problems
• Mathematics, Computer Science
46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05)
• 2005
A new "demand-robust" model motivated by recent work on two-stage stochastic optimization problems is formed and a general structural lemma about special types of first-stage solutions for such problems is proved.