Approximate cutting plane approaches for exact solutions to robust optimization problems
In this paper, approximate cutting plane approaches are proposed for robust optimization problems. Such an approach proceeeds iteratively in two stages: after the considered robust problem is solved with a reduced scenario set, a worst-case scenario is calculated which is afterwards added to the reduced scenario set. Then, again the robust problem is solved for the new reduced scenario set. Instead of solving both problems exactly, heuristics are proposed. It is proved that convergence to an optimal solution for such an approach is guaranteed under similar assumptions as for classical robust optimization cutting plane approaches. Experimental results are presented for robust mixed integer linear programs with mixed-integer polyhedral uncertainty sets.
- Cutting-set methods for robust convex optimization with pessimizing oracles
- Cutting plane versus compact formulations for uncertain (integer) linear programs
- Split cuts for robust mixed-integer optimization
- A utility theory based interactive approach to robustness in linear optimization
- scientific article; zbMATH DE number 2190135
- A Benders decomposition approach for the robust spanning tree problem with interval data
- A biobjective approach to recoverable robustness based on location planning
- A Hierarchy of Near-Optimal Policies for Multistage Adaptive Optimization
- A Polyhedral Approximation Framework for Convex and Robust Distributed Optimization
- A survey on robustness in railway planning
- An empirical analysis of robustness concepts for timetabling
- Cutting plane versus compact formulations for uncertain (integer) linear programs
- Cutting-set methods for robust convex optimization with pessimizing oracles
- Dominance for multi-objective robust optimization concepts
- Generalized light robustness and the trade-off between robustness and nominal quality
- Improving the modulo simplex algorithm for large-scale periodic timetabling
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Min-ordering and max-ordering scalarization methods for multi-objective robust optimization
- On exact solutions for the minmax regret spanning tree problem
- Random convex programs
- Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling
- Robust convex optimization
- Robust discrete optimization and its applications
- Robust load planning of trains in intermodal transportation
- Robust optimization
- Robust solutions of linear programming problems contaminated with uncertain data
- Robust Solutions to Least-Squares Problems with Uncertain Data
- Scenario relaxation algorithm for finite scenario-based min-max regret and min-max relative regret robust optimization
- Some outer approximation methods for semi-infinite optimization problems
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- The concept of recoverable robustness, linear programming recovery, and railway applications
- The Cutting-Plane Method for Solving Convex Programs
- The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs
- The Price of Robustness
- Uncertain convex programs: randomized solutions and confidence levels
- Regularized decomposition of large scale block-structured robust optimization problems
- Saddle point approximation approaches for two-stage robust optimization problems
- Cutting plane versus compact formulations for uncertain (integer) linear programs
- Optimized cutting plane algorithm for large-scale risk minimization
- Cutting-set methods for robust convex optimization with pessimizing oracles
- Split cuts for robust mixed-integer optimization
- Exact and overapproximated guarantees for corner cutting avoidance in a multiobstacle environment
- A Cutting Surface Algorithm for Semi-Infinite Convex Programming with an Application to Moment Robust Optimization
- Exact method based on solution space cut for bi-objective Seru production
- A mixed-integer approximation of robust optimization problems with mixed-integer adjustments
- Approaches for biobjective integer linear robust optimization
This page was built for publication: Approximate cutting plane approaches for exact solutions to robust optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2301927)
