Distributionally robust Weber problem with uncertain demand

Yan Gu, Jianlin Jiang () and Shun Zhang
Additional contact information
Yan Gu: Nanjing University of Aeronautics and Astronautics
Jianlin Jiang: Nanjing University of Aeronautics and Astronautics
Shun Zhang: Nanjing University of Aeronautics and Astronautics

Computational Optimization and Applications, 2023, vol. 85, issue 3, No 3, 705-752

Abstract: Abstract Weber problem is an important model in facility location field, and it can be modeled as a stochastic problem when the future demand of customers is uncertain. By minimizing the maximal expectation of the objective on an ambiguity set, the distributionally robust optimization (DRO) can utilize the valuable information from historical data and thus it has become an attractive formulation for stochastic problems. In this paper, an extended moment-based DRO formulation and a polynomial-time algorithm are contributed to solving the Weber problem with uncertain demand. Specifically, by constructing a new ambiguity set, which is proved to contain the true distribution with high probability, an extended DRO formulation allowing positive semidefinite covariance matrix is first built for general stochastic problems. To obtain a more robust solution, the Weber problem is then reformulated into an equivalent stochastic variational inequality (SVI). Following the extended DRO formulation, a distributionally robust Weber problem (DRWP) is further developed with minimizing the expectation of a residual function of the SVI. The DRWP can be transformed to a semidefinite program (SDP) with an undesired exponential number of constraints. Through the adoption of a plane decomposition technique, a simple algorithm is proposed to solve the resulted SDP and obtain the optimal solution to DRWP in polynomial time. Some preliminary numerical results demonstrate the effectiveness of the proposed DRWP and algorithm.

Keywords: Distributionally robust optimization; Positive semidefinite covariance matrix; Stochastic variational inequality; Polynomial-time algorithm; Alternating direction method of multipliers; Plane decomposition technique (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10589-023-00470-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:coopap:v:85:y:2023:i:3:d:10.1007_s10589-023-00470-7

Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589

DOI: 10.1007/s10589-023-00470-7

Access Statistics for this article

Computational Optimization and Applications is currently edited by William W. Hager

More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().