Robust combinatorial optimization under budgeted–ellipsoidal uncertainty

Jannis Kurtz ()
Additional contact information
Jannis Kurtz: RWTH Aachen University

EURO Journal on Computational Optimization, 2018, vol. 6, issue 4, No 1, 315-337

Abstract: Abstract In the field of robust optimization, uncertain data are modeled by uncertainty sets which contain all relevant outcomes of the uncertain problem parameters. The complexity of the related robust problem depends strongly on the shape of the chosen set. Two popular classes of uncertainty are budgeted uncertainty and ellipsoidal uncertainty. In this paper, we introduce a new uncertainty class which is a combination of both. More precisely, we consider ellipsoidal uncertainty sets with the additional restriction that at most a certain number of ellipsoid axes can be used at the same time to describe a scenario. We define a discrete and a convex variant of the latter set and prove that in both cases the corresponding robust min–max problem is NP-hard for several combinatorial problems. Furthermore, we prove that for uncorrelated budgeted–ellipsoidal uncertainty in both cases the min–max problem can be solved in polynomial time for several combinatorial problems if the number of axes which can be used at the same time is fixed. We derive exact solution methods and formulations for the problem which we test on random instances of the knapsack problem and of the shortest path problem.

Keywords: Robust optimization; Combinatorial optimization; Budgeted uncertainty; Ellipsoidal uncertainty; Complexity; 90C27 (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1007/s13675-018-0097-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:eurjco:v:6:y:2018:i:4:d:10.1007_s13675-018-0097-7

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/13675

DOI: 10.1007/s13675-018-0097-7

Access Statistics for this article

EURO Journal on Computational Optimization is currently edited by Martine C. Labbé

More articles in EURO Journal on Computational Optimization from Springer, EURO - The Association of European Operational Research Societies
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().