|
|||||
|
|
Robust linear optimization under general norms |
|
| Authors: | Dimitris Bertsimas Dessislava Pachamanova |
| Affiliation: | a Sloan School of Management, Massachusetts Institute of Technology, Building E52-363, 50 Memorial Drive, Cambridge, MA 02142-1347, USA b Department of Mathematics and Sciences, Babson College, Forest Street, Babson Park, MA 02457, USA c NUS Business School, National University of Singapore, 1 Business Link, Singapore 117592, Singapore |
| Abstract: | We explicitly characterize the robust counterpart of a linear programming problem with uncertainty set described by an arbitrary norm. Our approach encompasses several approaches from the literature and provides guarantees for constraint violation under probabilistic models that allow arbitrary dependencies in the distribution of the uncertain coefficients. |
| Keywords: | Robust optimization Stochastic programming Linear programming Norms Dual norms Constraint violation |
| 本文献已被 ScienceDirect 等数据库收录！ | |