First order dependence on uncertainty sets in robust optimization
classification
🧮 math.OC
keywords
firstorderproblemoptimizationrobustuncertaintyapproximatedependence
read the original abstract
We show that a first order problem can approximate solutions of a robust optimization problem when the uncertainty set is scaled, and explore further properties of this first order problem.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.