A data-driven distributionally robust bound on the expected optimal value of uncertain mixed 0-1 linear programming
From MaRDI portal
Publication:1789641
Abstract: This paper studies the expected optimal value of a mixed 0-1 programming problem with uncertain objective coefficients following a joint distribution. We assume that the true distribution is not known exactly, but a set of independent samples can be observed. Using the Wasserstein metric, we construct an ambiguity set centered at the empirical distribution from the observed samples and containing the true distribution with a high statistical guarantee. The problem of interest is to investigate the bound on the expected optimal value over the Wasserstein ambiguity set. Under standard assumptions, we reformulate the problem into a copositive program, which naturally leads to a tractable semidefinite-based approximation. We compare our approach with a moment-based approach from the literature on three applications. Numerical results illustrate the effectiveness of our approach.
Recommendations
- Distributionally robust optimization under moment uncertainty with application to data-driven problems
- Linear programming with uncertain data: some extensions to robust optimization
- On distributionally robust chance-constrained linear programs
- Mixed 0-1 Linear Programs Under Objective Uncertainty: A Completely Positive Representation
- scientific article; zbMATH DE number 7708787
- New robust optimization counterpart for linear optimization with uncertain data
- Robust solutions to multi-objective linear programs with uncertain data
- Distributionally Robust Linear and Discrete Optimization with Marginals
- Data-driven stochastic programming with distributionally robust constraints under Wasserstein distance: asymptotic properties
- A distributionally robust perspective on uncertainty quantification and chance constrained programming
Cites work
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 1312984 (Why is no real title available?)
- scientific article; zbMATH DE number 1775053 (Why is no real title available?)
- scientific article; zbMATH DE number 5493304 (Why is no real title available?)
- A gentle, geometric introduction to copositive optimization
- Ambiguity in portfolio selection
- Ambiguous chance constrained problems and robust optimization
- Ambiguous joint chance constraints under mean and dispersion information
- Bounding the Project Completion Time Distribution in PERT Networks
- Copositive programming
- Data-driven chance constrained stochastic program
- Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
- Data-driven robust optimization
- Distributionally Robust Convex Optimization
- Distributionally robust joint chance constraints with second-order moment information
- Distributionally robust multi-item newsvendor problems with multimodal demand distributions
- Distributionally robust optimization under moment uncertainty with application to data-driven problems
- Efficient Estimation of Arc Criticalities in Stochastic Activity Networks
- Generalized Chebyshev Bounds via Semidefinite Programming
- Mixed 0-1 Linear Programs Under Objective Uncertainty: A Completely Positive Representation
- On Cones of Nonnegative Quadratic Functions
- On distributionally robust chance-constrained linear programs
- On duality theory of conic linear problems.
- On reduced semidefinite programs for second order moment bounds with applications
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Optimal Inequalities in Probability Theory: A Convex Optimization Approach
- Persistence in discrete optimization under data uncertainty
- Persistency model and its applications in choice modeling
- Probabilistic Combinatorial Optimization: Moments, Semidefinite Programming, and Asymptotic Bounds
- Representing quadratically constrained quadratic programs as generalized copositive programs
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- The \(\zeta(2)\) limit in the random assignment problem
- The earth mover's distance as a metric for image retrieval
- The ellipsoid method and its consequences in combinatorial optimization
- The minimax approach to stochastic programming and an illustrative application
- Worst-Case Value-At-Risk and Robust Portfolio Optimization: A Conic Programming Approach
Cited in
(3)
This page was built for publication: A data-driven distributionally robust bound on the expected optimal value of uncertain mixed 0-1 linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1789641)
