Data-driven pricing and inventory management with applications in fashion retail
Name
1138022422-MIT.pdf
Size
12.44 MB
Format
Adobe PDF
Checksum (MD5)
df1a8ee2a5a3fd7e16b75e559c7f77da
Author(s)
Nambiar, Mila.
Advisor(s)
David Simchi-Levi.
Date Issued
2019
Publisher
Massachusetts Institute of Technology
Abstract
Fashion retail is typically characterized by (1) high demand uncertainty and products with short life cycles, which complicates demand forecasting, and (2) low salvage values and long supply lead times, which penalizes for inaccurate demand forecasting. In this thesis, we are interested in the design of algorithms that leverage fashion retail data to improve demand forecasting, and that make revenue-maximizing or cost-minimizing pricing and inventory management decisions. First, we study a multi-period dynamic pricing problem with feature information. We are especially interested in demand model misspecification, and show that it can lead to price endogeneity, and hence inconsistent price elasticity estimates and suboptimal pricing decisions. We propose a "random price shock" (RPS) algorithm that combines instrumental variables, well known in econometrics, with online learning, in order to simultaneously estimate demand and optimize revenue.
We demonstrate strong theoretical guarantees on the regret of RPS for both IID and non ID features, and numerically validate the algorithm's performance on synthetic data. Next, we present a case study in collaboration with Oracle Retail. We extend RPS to incorporate common business constraints such as markdown pricing and inventory constraints. We then conduct a counterfactual analysis where we simulate the algorithm's performance using fashion retail data. Our analysis estimates that the RPS algorithm will increase by 2-7% relative to current practice. Finally, we study an inventory allocation problem in a single-warehouse multiple-retailer setting with lost sales. We show that under general conditions this problem is convex, and that a Lagrangian relaxation-based approach can be applied to solve it in a computationally tractable, and near-optimal way.
This analysis allows us to prove structural results that give insights into how the allocation policy should depend on factors such as the retailer demand distributions, and demand learning.
Description
Thesis: Ph. D., Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2019
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 167-171).
Subjects
Operations Research Center.
MIT Department
Massachusetts Institute of Technology. Operations Research Center
Sloan School of Management
Terms of Use
MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission.
Persistent DSpace Link
