A decomposition method for distributionally-robust two-stage stochastic mixed-integer conic programs
From MaRDI portal
Publication:2097655
DOI10.1007/s10107-021-01641-2zbMath1506.90187arXiv1911.08713OpenAlexW3166772905MaRDI QIDQ2097655
Publication date: 14 November 2022
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.08713
disjunctive programmingdistributionally robust optimizationstochastic facility locationtwo-stage stochastic mixed integer conic programmingtwo-stage stochastic mixed integer second-order-cone programming
Semidefinite programming (90C22) Applications of mathematical programming (90C90) Mixed integer programming (90C11) Stochastic programming (90C15) Robustness in mathematical programming (90C17)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Relative entropy optimization and its applications
- The ancestral Benders' cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- Conic mixed-integer rounding cuts
- A cutting-plane approach to mixed 0-1 stochastic integer programs
- Disjunctive programming: Properties of the convex hull of feasible points
- L-shaped decomposition of two-stage stochastic programs with integer recourse
- Polyhedral approximation in mixed-integer convex optimization
- Estimation of time-varying parameters in statistical models: An optimization approach
- On solving two-stage distributionally robust disjunctive programs with a general ambiguity set
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs
- Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming
- The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification
- Finite Disjunctive Programming Characterizations for General Mixed-Integer Linear Programs
- Continuity Properties of Expectation Functions in Stochastic Integer Programming
- Integer Programming
- On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- The value function of an integer program
- Introduction to Stochastic Programming
- Decomposition Algorithms for Two-Stage Distributionally Robust Mixed Binary Programs
- Tight Second Stage Formulations in Two-Stage Stochastic Mixed Integer Programs
- Finitely Convergent Decomposition Algorithms for Two-Stage Stochastic Pure Integer Programs
- Optimal Transport