Zhi Chen

Zhi Chen

Auto-generated profile, based on publicly available information

Zhi Chen

Department of Decisions, Operations and Technology, CUHK Business School, The Chinese University of Hong Kong, Hong Kong

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 August 2020 in Management Science
Verified
Journal Article
Closed access
ZCZhi Chen
Zhi Chen
MSMelvyn Sim
Melvyn Sim
PXPeng Xiong
Peng Xiong
We present a new distributionally robust optimization model called robust stochastic optimization (RSO), which unifies both scenario-tree-based stochastic linear optimization and distributionally robust optimization in a practicable framework that can be solved using the state-of-the-art commercial optimization solvers. We also develop a new algebraic modeling package, Robust Stochastic Optimization Made Easy (RSOME), to facilitate the implementation of RSO models. The model of uncertainty incorporates both discrete and continuous random variables, typically assumed in scenario-tree-based stochastic linear optimization and distributionally robust optimization, respectively. To address the nonanticipativity of recourse decisions, we introduce the event-wise recourse adaptations, which integrate the scenario-tree adaptation originating from stochastic linear optimization and the affine adaptation popularized in distributionally robust optimization. Our proposed event-wise ambiguity set is rich enough to capture traditional statistic-based ambiguity sets with convex generalized moments, mixture distribution, φ-divergence, Wasserstein (Kantorovich-Rubinstein) metric, and also inspire machine-learning-based ones using techniques such as K-means clustering and classification and regression trees. Several interesting RSO models, including optimizing over the Hurwicz criterion and two-stage problems over Wasserstein ambiguity sets, are provided. This paper was accepted by David Simchi-Levi, optimization.

1 January 2024 in Operations Research
Verified
Journal Article
Closed access
ZCZhi Chen
Zhi Chen
DKDaniel Kuhn
Daniel Kuhn
WWWolfram Wiesemann
Wolfram Wiesemann
In the era of modern business analytics, data-driven optimization has emerged as a popular modeling paradigm to transform data into decisions. By constructing an ambiguity set of the potential data-generating distributions and subsequently hedging against all member distributions within this ambiguity set, data-driven optimization effectively combats the ambiguity with which real-life data sets are plagued. Chen et al. (2022) study data-driven, chance-constrained programs in which a decision has to be feasible with high probability under every distribution within a Wasserstein ball centered at the empirical distribution. The authors show that the problem admits an exact deterministic reformulation as a mixed-integer conic program and demonstrate (in numerical experiments) that the reformulation compares favorably to several state-of-the-art data-driven optimization schemes.

1 September 2020 in Transportation Science
Verified
Journal Article
Closed access
SWShuming Wang
Shuming Wang
ZCZhi Chen
Zhi Chen
TLTianqi Liu
Tianqi Liu
We study the adaptive distributionally robust hub location problem with multiple commodities under demand and cost uncertainty in both uncapacitated and capacitated cases. The hub location decision anticipates the worst-case expected cost over an ambiguity set of possible distributions of the uncertain demand and cost, and the routing policy, being adaptive to the uncertainty realization, ships commodities through selected hubs. We investigate the adaptivity and tractability of the distributionally robust model under different distributional information about uncertainty. In the uncapacitated case in which demand and cost are independent and costs of different commodities are also mutually independent, the adaptive distributionally robust model is equivalent to a nonadaptive classical robust model and the second-stage routing decision follows an optimal static policy. We then relax the independence assumption and show that the second-stage routing decision follows an optimal scenario-wise policy if either the demand or the cost is supported on a convex hull of given scenarios. We extend our analysis to the capacitated case and show that the second-stage routing decision still follows an optimal scenario-wise policy if the demand is supported on the convex hull of given scenarios. In terms of tractability, for all mentioned cases, we reformulate the distributionally robust model as a moderate-sized mixed-integer linear program, and we recover the associated worst-case distribution by solving a collection of linear programs. Through numerical studies using the Civil Aeronautics Board data set, we demonstrate the advantages of the distributionally robust model by examining its superior out-of-sample performance against the classical robust model and the stochastic model.

1 September 2019 in Operations Research
Verified
Journal Article
Closed access
ZCZhi Chen
Zhi Chen
MSMelvyn Sim
Melvyn Sim
HXHuan Xu
Huan Xu
Distributionally robust optimization has grown into one of the most popular approaches in addressing optimization under uncertainty. As its key ingredient, the ambiguity set specifies several types of distributional information about the ambiguous true distribution. In “Distributionally Robust Optimization with Infinitely Constrained Ambiguity Sets,” Z. Chen, M. Sim, and H. Xu contribute to the existing ambiguity sets in the literature, by proposing a new class of ambiguity sets that encompasses a potentially infinite number of expectation constraints. This class has the benefits of, among other things, a tighter approximation of stochastic independence that is ubiquitous in characterizing uncertainty. The authors propose an algorithm involving a greedy improvement procedure to solve the corresponding distributionally robust optimization problem. In their computational study, the authors are able to obtain significantly improved solutions using this algorithm.

30 June 2021 in Production and Operations Management
Verified
Journal Article
Closed access
PDF file
ZCZhi Chen
Zhi Chen
WXWeijun Xie
Weijun Xie

18 August 2019 in Optimization
Verified
Journal Article
Closed access
ZCZhi Chen
Zhi Chen
PYPengqian Yu
Pengqian Yu
WHWilliam B. Haskell
William B. Haskell
The distributionally robust Markov Decision Process (MDP) approach asks for a distributionally robust strategy that achieves the maximal expected total reward under the most adversarial distribution of uncertain parameters. In this paper, we study distributionally robust MDPs where ambiguity sets for the uncertain parameters are of a format that can easily incorporate in its description the generalized moment as well as statistical distance information of the uncertainty. In this way, we generalize existing works on distributionally robust MDPs with generalized-moment-based and statistical-distance-based ambiguity sets to incorporate information from the former class such as moments and dispersions to the latter class that critically depends on empirical observations of the uncertain parameters. We show that under this format of ambiguity sets, the resulting distributionally robust MDP remains tractable under mild technical conditions and a distributionally robust strategy can be constructed by solving a sequence of one-stage convex optimization subproblems through a Bellman type backward induction.