Short Paper - A Note on Robust Combinatorial Optimization with Generalized Interval Uncertainty
In this paper, we consider a robust combinatorial optimization problem with uncertain weights and propose an uncertainty set that generalizes interval uncertainty by imposing lower and upper bounds on deviations of subsets of items. We prove that if the number of such subsets is fixed and the family...
Saved in:
Main Author: | |
---|---|
Format: | Article |
Language: | English |
Published: |
Université de Montpellier
2023-06-01
|
Series: | Open Journal of Mathematical Optimization |
Subjects: | |
Online Access: | https://ojmo.centre-mersenne.org/articles/10.5802/ojmo.23/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
_version_ | 1825205021692657664 |
---|---|
author | Yaman, Hande |
author_facet | Yaman, Hande |
author_sort | Yaman, Hande |
collection | DOAJ |
description | In this paper, we consider a robust combinatorial optimization problem with uncertain weights and propose an uncertainty set that generalizes interval uncertainty by imposing lower and upper bounds on deviations of subsets of items. We prove that if the number of such subsets is fixed and the family of these subsets is laminar, then the robust combinatorial optimization problem can be solved by solving a fixed number of nominal problems. This result generalizes a previous similar result for the case where the family of these subsets is a partition of the set of items. |
format | Article |
id | doaj-art-c0f6d5c98c42494e95d0e373f412cb0d |
institution | Kabale University |
issn | 2777-5860 |
language | English |
publishDate | 2023-06-01 |
publisher | Université de Montpellier |
record_format | Article |
series | Open Journal of Mathematical Optimization |
spelling | doaj-art-c0f6d5c98c42494e95d0e373f412cb0d2025-02-07T14:02:56ZengUniversité de MontpellierOpen Journal of Mathematical Optimization2777-58602023-06-0141710.5802/ojmo.2310.5802/ojmo.23Short Paper - A Note on Robust Combinatorial Optimization with Generalized Interval UncertaintyYaman, Hande0ORSTAT, Faculty of Economics and Business KU Leuven, 3000 Leuven, BelgiumIn this paper, we consider a robust combinatorial optimization problem with uncertain weights and propose an uncertainty set that generalizes interval uncertainty by imposing lower and upper bounds on deviations of subsets of items. We prove that if the number of such subsets is fixed and the family of these subsets is laminar, then the robust combinatorial optimization problem can be solved by solving a fixed number of nominal problems. This result generalizes a previous similar result for the case where the family of these subsets is a partition of the set of items.https://ojmo.centre-mersenne.org/articles/10.5802/ojmo.23/robust combinatorial optimizationinterval uncertaintybudgeted uncertaintycomplexity |
spellingShingle | Yaman, Hande Short Paper - A Note on Robust Combinatorial Optimization with Generalized Interval Uncertainty Open Journal of Mathematical Optimization robust combinatorial optimization interval uncertainty budgeted uncertainty complexity |
title | Short Paper - A Note on Robust Combinatorial Optimization with Generalized Interval Uncertainty |
title_full | Short Paper - A Note on Robust Combinatorial Optimization with Generalized Interval Uncertainty |
title_fullStr | Short Paper - A Note on Robust Combinatorial Optimization with Generalized Interval Uncertainty |
title_full_unstemmed | Short Paper - A Note on Robust Combinatorial Optimization with Generalized Interval Uncertainty |
title_short | Short Paper - A Note on Robust Combinatorial Optimization with Generalized Interval Uncertainty |
title_sort | short paper a note on robust combinatorial optimization with generalized interval uncertainty |
topic | robust combinatorial optimization interval uncertainty budgeted uncertainty complexity |
url | https://ojmo.centre-mersenne.org/articles/10.5802/ojmo.23/ |
work_keys_str_mv | AT yamanhande shortpaperanoteonrobustcombinatorialoptimizationwithgeneralizedintervaluncertainty |