Exact approaches for convex adjustable robust optimization
From MaRDI portal
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 fast exact method for the capacitated facility location problem with differentiable convex production costs
- A minmax theorem for concave-convex mappings with no regularity assumptions
- A new dual-based cutting plane algorithm for nonlinear adjustable robust optimization
- A Representation and Economic Interpretation of a Two-Level Programming Problem
- A solution algorithm for chance-constrained problems with integer second-stage recourse decisions
- A survey of nonlinear robust optimization
- Adjustability in robust linear optimization
- Adjustable robust counterpart of conic quadratic problems
- Adjustable robust optimization models for a nonlinear two-period system
- Adjustable robust optimization via Fourier-Motzkin elimination
- Adjustable robust solutions of uncertain linear programs
- An integer programming and decomposition approach to general chance-constrained mathematical programs
- Bilevel knapsack with interdiction constraints
- Bilevel linear optimization belongs to NP and admits polynomial-size KKT-based reformulations
- Convexity and concavity properties of the optimal value function in parametric nonlinear programming
- Decomposition for adjustable robust linear optimization subject to uncertainty polytope
- Deriving robust counterparts of nonlinear uncertain inequalities
- Designing tractable piecewise affine policies for multi-stage adjustable robust optimization
- Discrete linear bilevel programming problem
- Duality in two-stage adaptive linear optimization: faster computation and stronger bounds
- Exact augmented Lagrangian duality for mixed integer quadratic programming
- Finite Adaptability in Multistage Linear Optimization
- Generalized Benders decomposition
- scientific article; zbMATH DE number 1302171 (Why is no real title available?)
- Interdiction Games and Monotonicity, with Application to Knapsack Problems
- On the performance of affine policies for two-stage adaptive optimization: a geometric perspective
- On the power and limitations of affine policies in two-stage adaptive optimization
- Robust location transportation problems under uncertain demands
- Solving two-stage robust optimization problems using a column-and-constraint generation method
- Technical Note—Dual Approach for Two-Stage Robust Nonlinear Optimization
- The Price of Robustness
- Two-stage network constrained robust unit commitment problem
- When are static and adjustable robust optimization problems with constraint-wise uncertainty equivalent?
This page was built for publication: Exact approaches for convex adjustable robust optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7346547)
