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.
Citation
Under revision. Bibtex entry for temporary technical report: @unpublished{arslan:hal-02190059, TITLE = {{Decomposition-based approaches for a class of two-stage robust binary optimization problems}}, AUTHOR = {Arslan, Ay{\c s}e N and Detienne, Boris}, URL = {https://hal.inria.fr/hal-02190059}, NOTE = {working paper or preprint}, YEAR = {2020}, MONTH = Jul, PDF = {https://hal.inria.fr/hal-02190059/file/Decomposition_based_approaches_for_a_class_of_two_stage_robust_binary_optimization_problems_revision_2-2.pdf}, HAL_ID = {hal-02190059}, HAL_VERSION = {v4}, }
Article
View Decomposition-based approaches for a class of two-stage robust binary optimization problems