Adjustable Robust Optimization Reformulations of Two-Stage Worst-Case Regret Minimization Problems
From MaRDI portal
Publication:5058052
DOI10.1287/opre.2021.2159OpenAlexW2969212598MaRDI QIDQ5058052
Publication date: 1 December 2022
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.2021.2159
Related Items
Frameworks and results in distributionally robust optimization ⋮ Combinatorial optimization problems with balanced regret
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two-stage minimax regret robust uncapacitated lot-sizing problems with demand uncertainty
- Statistical decisions under ambiguity
- Primal and dual linear decision rules in stochastic and robust optimization
- On the power and limitations of affine policies in two-stage adaptive optimization
- On robust maximum flow with polyhedral uncertainty sets
- Min-max regret robust optimization approach on interval data uncertainty
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Lot-size models with backlogging: Strong reformulations and cutting planes
- Minimax regret solution to linear programming problems with an interval objective function
- Minmax regret linear resource allocation problems.
- Adjustable robust solutions of uncertain linear programs
- A survey of adjustable robust optimization
- A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides
- Decomposition for adjustable robust linear optimization subject to uncertainty polytope
- On the average performance of the adjustable RO and its use as an offline tool for multi-period production planning under uncertainty
- A heuristic to minimax absolute regret for linear programs with interval objective function coefficients
- On the complexity of minmax regret linear programming
- Robust regret for uncertain linear programs with application to co-production models
- Solving two-stage robust optimization problems using a column-and-constraint generation method
- Scenario relaxation algorithm for finite scenario-based min-max regret and min-max relative regret robust optimization
- On the complexity of the continuous unbounded knapsack problem with uncertain coefficients
- Duality in Two-Stage Adaptive Linear Optimization: Faster Computation and Stronger Bounds
- Robust Optimization Made Easy with ROME
- Uncertain Linear Programs: Extended Affinely Adjustable Robust Counterparts
- Minimising the maximum relative regret for linear programmes with interval objective function coefficients
- Optimality of Affine Policies in Multistage Robust Optimization
- Models for Minimax Stochastic Linear Optimization Problems with Risk Aversion
- Relative Robust and Adaptive Optimization
- Expected Value of Distribution Information for the Newsvendor Problem
- Regret in the Newsvendor Model with Partial Information
- A Linear Decision-Based Approximation Approach to Stochastic Programming
- The Price of Robustness
- An achievement rate approach to linear programming problems with an interval objective function
- Robustness and duality in linear programming
- Conic Programming Reformulations of Two-Stage Distributionally Robust Linear Programs over Wasserstein Balls
- Adjustable Robust Optimization via Fourier–Motzkin Elimination
- Linearized Robust Counterparts of Two-Stage Robust Optimization Problems with Applications in Operations Management
- Designing Response Supply Chain Against Bioattacks
- A Probabilistic Model for Minmax Regret in Combinatorial Optimization
- Newsvendor optimization with limited distribution information
- A Hierarchy of Near-Optimal Policies for Multistage Adaptive Optimization
- JuMP: A Modeling Language for Mathematical Optimization
- Intertemporal Pricing Under Minimax Regret
- Robust Optimization of Sums of Piecewise Linear Functions with Application to Inventory Problems
- The Theory of Statistical Decision
This page was built for publication: Adjustable Robust Optimization Reformulations of Two-Stage Worst-Case Regret Minimization Problems