Robust combinatorial optimization with variable budgeted uncertainty

Abstract : We introduce a new model for robust combinatorial optimization where the uncertain parameters belong to the image of multifunctions of the problem variables. In particular, we study the variable budgeted uncertainty, an extension of the budgeted uncertainty introduced by Bertsimas and Sim. Variable budgeted uncertainty can provide the same probabilistic guarantee as the budgeted uncertainty while being less conservative for vectors with few non-zero components. The feasibility set of the resulting optimization problem is in general non-convex so that we propose a mixed-integer programming reformulation for the problem, based on the dualization technique often used in robust linear programming. We show how to extend these results to non-binary variables and to more general multifunctions involving uncertainty set defined by conic constraints that are affine in the problem variables. We present a computational comparison of the budgeted uncertainty and the variable budgeted uncertainty on the robust knapsack problem. The experiments show a reduction of the price of robustness by an average factor of 18 %.
Document type :
Journal articles
Complete list of metadatas

Cited literature [8 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00916975
Contributor : Michael Poss <>
Submitted on : Wednesday, December 11, 2013 - 9:47:03 AM
Last modification on : Wednesday, November 28, 2018 - 10:54:08 AM
Long-term archiving on : Wednesday, March 12, 2014 - 1:25:14 AM

File

draft_.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Michael Poss. Robust combinatorial optimization with variable budgeted uncertainty. 4OR: A Quarterly Journal of Operations Research, Springer Verlag, 2013, 11 (1), pp.75-92. ⟨10.1007/s10288-012-0217-9⟩. ⟨hal-00916975⟩

Share

Metrics

Record views

175

Files downloads

369