Please use this identifier to cite or link to this item:
Title: Robust Multi-period Network Flows Optimization
Authors: WANG JIE
Keywords: Robust Optimization
Commodity Network Flow
Linear Decision Rule
Computational Tractability
Issue Date: 2009
Citation: WANG JIE (2009). Robust Multi-period Network Flows Optimization. ScholarBank@NUS Repository.
Abstract: In this paper, we extend a deterministic multi-period network flow model developed for a third party logistics (3PL) company to a robust optimization problem with uncertain market demand. We assume we are risk adverse and seek to maximize the worst case expected total margin. Since we are only exposed to partial information about the distributions of the market demand, we develop a robust multi-period network flow optimization model. Due to the complexity of the problem, we solve the linear decision rule (LDR) approximation of the problem and obtain an approximate solution. We also examine the degree of conservativeness of the LDR approximation by finding a computational tractable upper bound of the true objective. Then we compare the upper bound with the LDR objective through a numerical study and it is shown that the LDR approximation does a good job in approximating the true optimal solution.
Appears in Collections:Master's Theses (Restricted)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
Wang Jie_NUS thesis .pdf620.85 kBAdobe PDF


NoneLog In

Page view(s)

checked on Sep 18, 2020

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.