A double oracle approach to minmax regret optimization problems with interval data
From MaRDI portal
Abstract: In this paper, we provide a generic anytime lower bounding procedure for minmax regret optimization problems. We show that the lower bound obtained is always at least as accurate as the lower bound recently proposed by Chassein and Goerigk (2015). This lower bound can be viewed as the optimal value of a linear programming relaxation of a mixed integer programming formulation of minmax regret optimization, but the contribution of the paper is to compute this lower bound via a double oracle algorithm (McMahan et al., 2003) that we specify. The double oracle algorithm is designed by relying on a game theoretic view of robust optimization, similar to the one developed by Mastin et al. (2015), and it can be efficiently implemented for any minmax regret optimization problem whose standard version is "easy". We describe how to efficiently embed this lower bound in a branch and bound procedure. Finally, we apply our approach to the robust shortest path problem. Our numerical results show a significant gain in the computation times compared to previous approaches in the literature.
Recommendations
- A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem
- Minmax regret solutions for minimax optimization problems with uncertainty
- An approximation algorithm for interval data minmax regret combinatorial optimization problems
- Min max min robust (relative) regret combinatorial optimization
- A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs
Cites work
- scientific article; zbMATH DE number 3854804 (Why is no real title available?)
- A branch and bound algorithm for the robust shortest path problem with interval data.
- A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem
- A quick method for finding shortest pairs of disjoint paths
- An approximation algorithm for interval data minmax regret combinatorial optimization problems
- An exact algorithm for the robust shortest path problem with interval data
- Integer Programming
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Network flows. Theory, algorithms, and applications.
- Randomized minmax regret for combinatorial optimization under uncertainty
- Restricted robust uniform matroid maximization under interval uncertainty
- The ellipsoid method and its consequences in combinatorial optimization
- The robust shortest path problem with interval data via Benders decomposition
Cited in
(8)- Maximum excess dominance: identifying impractical solutions in linear problems with interval coefficients
- Combinatorial optimization problems with balanced regret
- The impacts of retailers' regret aversion on a random multi-period supply chain network
- Algorithms for the minmax regret path problem with interval data
- A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem
- Competitive difference analysis of the cash management problem with uncertain demands
- A discrete dynamics approach to sparse calculation and applied in ontology science
- On a Class of Interval Data Minmax Regret CO Problems
This page was built for publication: A double oracle approach to minmax regret optimization problems with interval data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1683128)
