Two-stage robust mixed integer programming problem with objective uncertainty
From MaRDI portal
Publication:723485
DOI10.1007/s11590-017-1176-zzbMath1402.90103OpenAlexW2741706972MaRDI QIDQ723485
Publication date: 31 July 2018
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-017-1176-z
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Exact augmented Lagrangian duality for mixed integer linear programming
- On the performance of affine policies for two-stage adaptive optimization: a geometric perspective
- Partitioning procedures for solving mixed-variables programming problems
- The value function of a mixed integer program: I
- The value function of a mixed integer program. II
- Adjustable robust solutions of uncertain linear programs
- On the augmented Lagrangian dual for integer programming
- Multistage Adjustable Robust Mixed-Integer Optimization via Iterative Splitting of the Uncertainty Set
- Uncertain Linear Programs: Extended Affinely Adjustable Robust Counterparts
- On the Power of Robust Solutions in Two-Stage Stochastic and Adaptive Optimization Problems
- Optimality of Affine Policies in Multistage Robust Optimization
- Design of Near Optimal Decision Rules in Multistage Adaptive Mixed-Integer Optimization
- K-Adaptability in Two-Stage Robust Binary Programming
- The value function of an integer program
- On the existence of optimal solutions to integer and mixed-integer programming problems
- Stochastic Programs with Fixed Recourse: The Equivalent Deterministic Program
- Supermodularity and Affine Policies in Dynamic Robust Optimization
- Convex Analysis
This page was built for publication: Two-stage robust mixed integer programming problem with objective uncertainty
