Distributionally robust Weber problem with uncertain demand
DOI10.1007/s10589-023-00470-7OpenAlexW4327591882MaRDI QIDQ6175466
Shun Zhang, Yan Gu, Jian-lin Jiang
Publication date: 24 July 2023
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-023-00470-7
polynomial-time algorithmalternating direction method of multipliersstochastic variational inequalitydistributionally robust optimizationplane decomposition techniquepositive semidefinite covariance matrix
Programming involving graphs or networks (90C35) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Robustness in mathematical programming (90C17)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Data-driven chance constrained stochastic program
- Proximal-like contraction methods for monotone variational inequalities in a unified framework. I: Effective quadruplet and primary methods
- Proximal-like contraction methods for monotone variational inequalities in a unified framework. II: General methods and numerical experiments
- A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand
- Expected residual minimization method for stochastic variational inequality problems
- Sample average approximation method for chance constrained programming: Theory and applications
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Probabilistic methods for algorithmic discrete mathematics
- Distributionally robust optimization with matrix moment constraints: Lagrange duality and cutting plane methods
- Robust VaR and CVaR optimization under joint ambiguity in distributions, means, and covariances
- A heuristic method for large-scale multi-facility location problems
- Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
- The sample average approximation method applied to stochastic routing problems: a computational study
- Frameworks and results in distributionally robust optimization
- An ADMM-based location-allocation algorithm for nonconvex constrained multi-source Weber problem under gauge
- A heuristic algorithm for constrained multi-source Weber problem - the variational inequality approach
- Ambiguous chance constrained problems and robust optimization
- Minmax regret maximal covering location problems with edge demands
- Stochastic Variational Inequalities: Residual Minimization Smoothing Sample Average Approximations
- Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems
- Partial Error Bound Conditions and the Linear Convergence Rate of the Alternating Direction Method of Multipliers
- Expected Value of Distribution Information for the Newsvendor Problem
- Worst-Case Value-At-Risk and Robust Portfolio Optimization: A Conic Programming Approach
- The Price of Robustness
- Using Block Norms for Location Modeling
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- The minimax approach to stochastic programming and an illustrative application
- Optimal Inequalities in Probability Theory: A Convex Optimization Approach
- Acceleration on Adaptive Importance Sampling with Sample Average Approximation
- Link-Length Minimization in Networks
- Convex Analysis
- A Semidefinite Programming Approach to Optimal-Moment Bounds for Convex Classes of Distributions
- A Survey of the S-Lemma
- A modified Weiszfeld algorithm for the Fermat-Weber location problem
- Equilibrium problems: nonsmooth optimization and variational inequality models
This page was built for publication: Distributionally robust Weber problem with uncertain demand
