Decomposition-based approaches for a class of two-stage robust binary optimization problems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles INFORMS Journal on Computing Year : 2022

Decomposition-based approaches for a class of two-stage robust binary optimization problems

Abstract

In this paper, we study a class of two-stage robust binary optimization problems with objective uncertainty where recourse decisions are restricted to be mixed-binary. For these problems, we present a deterministic equivalent formulation through the convexification of the recourse feasible region. We then explore this formulation under the lens of a relaxation, showing that the specific relaxation we propose can be solved using the branch-and-price algorithm. We present conditions under which this relaxation is exact, and describe alternative exact solution methods when this is not the case. Despite the two-stage nature of the problem, we provide NP-completeness results based on our reformulations. Finally, we present various applications in which the methodology we propose can be applied. We compare our exact methodology to those approximate methods recently proposed in the literature under the name K-adaptability. Our computational results show that our methodology is able to produce better solutions in less computational time compared to the K-adaptability approach, as well as to solve bigger instances than those previously managed in the literature.
Fichier principal
Vignette du fichier
Decomposition_based_approaches_for_a_class_of_two_stage_robust_binary_optimization_problems_revision_2-2.pdf (657.18 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02190059 , version 1 (21-07-2019)
hal-02190059 , version 2 (24-07-2019)
hal-02190059 , version 3 (17-06-2020)
hal-02190059 , version 4 (28-07-2020)

Identifiers

Cite

Ayşe N Arslan, Boris Detienne. Decomposition-based approaches for a class of two-stage robust binary optimization problems. INFORMS Journal on Computing, 2022, 34 (2), ⟨10.1287/ijoc.2021.1061⟩. ⟨hal-02190059v4⟩
418 View
584 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More