A Robust Robust Optimization Result
classification
🧮 math.OC
keywords
lossobjectiverobustarbitraryaveragecompactfeasibleinaccurate
read the original abstract
We study the loss in objective value when an inaccurate objective is optimized instead of the true one, and show that "on average" this loss is very small, for an arbitrary compact feasible region.
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.