Abstract
A robust approach to solving linear optimization problems with uncertain data was proposed in the early 1970s and has recently been extensively studied and extended. Under this approach, we are willing to accept a suboptimal solution for the nominal values of the data in order to ensure that the solution remains feasible and near optimal when the data changes. A concern with such an approach is that it might be too conservative. In this paper, we propose an approach that attempts to make this trade-off more attractive; that is, we investigate ways to decrease what we call the price of robustness. In particular, we flexibly adjust the level of conservatism of the robust solutions in terms of probabilistic…
Citation impact
4,379
total citations
- FWCI
- 42.85
- Percentile
- 100%
- References
- 12
Citations per year
Authors
2Topics & keywords
Topics
Keywords
- Robustness (evolution)
- Mathematical optimization
- Robust optimization
- Computer science
- Knapsack problem
- Uncertain data
- Probabilistic logic
- Linear programming
No related works found for this paper.