Robust solutions of uncertain linear programs Export

@article{BenTal99, abstract = {We treat in this paper linear programming (LP) problems with uncertain data. The focus is on uncertainty associated with hard constraints: those which must be satisfied, whatever is the actual realization of the data (within a prescribed uncertainty set). We suggest a modeling methodology whereas an uncertain LP is replaced by its robust counterpart (RC). We then develop the analytical and computational optimization tools to obtain robust solutions of an uncertain LP problem via solving the corresponding explicitly stated convex RC program. In particular, it is shown that the RC of an LP with ellipsoidal uncertainty set is computationally tractable, since it leads to a conic quadratic program, which can be solved in polynomial time.}, author = {Ben-Tal, A. and Nemirovski, A.}, citeulike-article-id = {1439880}, citeulike-linkout-0 = {http://dx.doi.org/10.1016/S0167-6377(99)00016-4}, citeulike-linkout-1 = {http://www.ingentaconnect.com/content/els/01676377/1999/00000025/00000001/art00016}, citeulike-linkout-2 = {http://www.sciencedirect.com/science/article/B6V8M-3WYHVTG-1/2/af60891c09fa9dd8a5c09130e47d89d9}, doi = {10.1016/S0167-6377(99)00016-4}, issn = {0167-6377}, journal = {Operations Research Letters}, keywords = {optimization, robustness}, month = {August}, number = {1}, pages = {1--13}, posted-at = {2007-11-19 01:26:42}, priority = {1}, publisher = {Elsevier}, title = {Robust solutions of uncertain linear programs}, url = {http://dx.doi.org/10.1016/S0167-6377(99)00016-4}, volume = {25}, year = {1999} }

TY - JOUR ID - BenTal99 L3 - citeulike-article-id:1439880 N2 - We treat in this paper linear programming (LP) problems with uncertain data. The focus is on uncertainty associated with hard constraints: those which must be satisfied, whatever is the actual realization of the data (within a prescribed uncertainty set). We suggest a modeling methodology whereas an uncertain LP is replaced by its robust counterpart (RC). We then develop the analytical and computational optimization tools to obtain robust solutions of an uncertain LP problem via solving the corresponding explicitly stated convex RC program. In particular, it is shown that the RC of an LP with ellipsoidal uncertainty set is computationally tractable, since it leads to a conic quadratic program, which can be solved in polynomial time. IS - 1 JF - Operations Research Letters SN - 0167-6377 EP - 13 TI - Robust solutions of uncertain linear programs PB - Elsevier VL - 25 SP - 1 KW - optimization KW - robustness AU - Ben-Tal, A AU - Nemirovski, A PY - 1999/08// UR - http://dx.doi.org/10.1016/S0167-6377(99)00016-4 ER -