A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475)
Many engineering problems can be cast as optimization problems subject to convex constraints that are parameterized by an uncertainty or 'instance' term. A recently emerged successful paradigm for attacking these problems is robust optimization, where one seeks a solution which simultaneously satisfies all possible constraint instances. In practice, however, the robust approach is computationally viable only for problem families with rather simple dependence on the instance parameter (such asdoi:10.1109/cdc.2003.1272983 fatcat:ykzef3hewzamva36fwnbm4swai