Adaptive robust optimization with objective uncertainty - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year : 2021

Adaptive robust optimization with objective uncertainty

Abstract

In this work, we study optimization problems where some cost parameters are not known at decision time and the decision flow is modeled as a two-stage process within a robust optimization setting. We address general problems in which all constraints (including those linking the first and the second stages) are defined by convex functions and involve mixed-integer variables, thus extending the existing literature to a much wider class of problems. We show how these problems can be reformulated using Fenchel duality, allowing to derive an enumerative exact algorithm, for which we prove-convergence in a finite number of operations. An implementation of the resulting algorithm, embedding a column generation scheme, is then computationally evaluated on two different problems, using instances that are derived starting from the existing literature. To the best of our knowledge, this is the first approach providing results on the practical solution of this class of problems.
Fichier principal
Vignette du fichier
8613.pdf (563.99 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03371438 , version 1 (08-10-2021)

Identifiers

  • HAL Id : hal-03371438 , version 1

Cite

Boris Detienne, Henri Lefebvre, Enrico Malaguti, Michele Monaci. Adaptive robust optimization with objective uncertainty. 2021. ⟨hal-03371438⟩
132 View
205 Download

Share

Gmail Facebook X LinkedIn More