Adjustable robust optimization with objective uncertainty

DOI10.1016/J.EJOR.2023.06.042MaRDI QIDQ6069242zbMATH OpenFDO

Authors Boris Detienne, Henri Lefebvre, Enrico Malaguti, Michele Monaci

Publication date 14 November 2023

Published in European Journal of Operational Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1016/J.EJOR.2023.06.042

zbMATH Keywords

branch-and-pricecomputational experimentsFenchel dualityreformulationtwo-stage robust optimizationuncertainty modelling

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• \(K\)-adaptability in two-stage mixed-integer robust optimization
• K-adaptability in two-stage robust binary programming
• A comparison of heuristics and relaxations for the capacitated plant location problem
• A finite \(\epsilon\)-convergence algorithm for two-stage stochastic convex nonlinear programs with mixed-binary first and second-stage variables
• A minmax theorem for concave-convex mappings with no regularity assumptions
• A modification of Benders' decomposition algorithm for discrete subproblems: An approach for stochastic programs with integer recourse
• A survey of adjustable robust optimization
• A survey of nonlinear robust optimization
• Adjustable robust solutions of uncertain linear programs
• Benders decomposition without separability: a computational study for capacitated facility location problems
• Convex Analysis
• Convex programming for disjunctive convex optimization
• Decomposition for adjustable robust linear optimization subject to uncertainty polytope
• Decomposition-Based Approaches for a Class of Two-Stage Robust Binary Optimization Problems
• Finite Adaptability in Multistage Linear Optimization
• Generalized disjunctive programming: a framework for formulation and alternative algorithms for MINLP optimization
• Min-max and min-max regret versions of combinatorial optimization problems: A survey
• On solving discrete two-stage stochastic programs having mixed-integer first- and second-stage variables
• Oracle-based algorithms for binary two-stage robust optimization
• Robust location transportation problems under uncertain demands
• Robust optimization
• Solving two-stage robust optimization problems using a column-and-constraint generation method
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
• The congested facility location problem
• The Price of Robustness
• Theory and applications of robust optimization
• Two-stage network constrained robust unit commitment problem

Cited in

(2)

• Robust parallel machine selection and scheduling with uncertain release times
• A robust optimization approach for a two-player force-design game

This page was built for publication: Adjustable robust optimization with objective uncertainty

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6069242)