Efficient Computational Strategies for Dynamic Inventory Liquidation

Information Systems Research, Forthcoming

Kelley School of Business Research Paper No. 18-79

74 Pages Posted: 2 Oct 2018

See all articles by Mochen Yang

Mochen Yang

University of Minnesota - Twin Cities - Carlson School of Management

Gediminas Adomavicius

University of Minnesota - Twin Cities - Carlson School of Management

Alok Gupta

University of Minnesota - Twin Cities - Carlson School of Management

Date Written: September 1, 2018

Abstract

We develop efficient computational strategies for inventory liquidation problem, which is characterized by a retailer disposing of a fixed amount of inventory over a period of time. Liquidating end-of-cycle products optimally represents a challenging problem due to its inherent stochasticity. The growing scale of liquidation problems further increases the need for solutions that are revenue- and time-efficient. We propose to address the inventory liquidation problem by deriving deterministic representations of stochastic demand, which provides significant theoretical and practical benefits as well as an intuitive understanding of the problem and the proposed solution. First, this paper develops a dynamic programming approach and a greedy heuristic approach to find the optimal liquidation strategy under deterministic demand representation. Importantly, we show that our heuristic approach is optimal under realistic conditions and is computationally less complex than dynamic programming. Second, we explore the relationships between liquidation revenue and several key elements of the liquidation problem via both computational experiments and theoretical analyses. We derive multiple managerial implications and demonstrate how the proposed heuristic approach can serve as an efficient decision support tool for inventory managers. Third, under stochastic demand, we conduct a comprehensive set of simulation experiments to benchmark the performance of our proposed heuristic approach with alternatives, including other simple approaches (e.g., the fixed-price strategy) as well as advanced stochastic approaches (e.g., stochastic dynamic programming). In particular, we consider a strategy that uses the proposed greedy heuristic to determine prices iteratively throughout the liquidation period. Computational experiments demonstrate that such iterative strategy stably produces higher total revenue than other alternatives, and produces near-optimal total revenue in expectation while maintaining significant computational efficiency, compared to advanced techniques that solve the liquidation problem directly under stochastic demand. Our work advances the computational design for inventory liquidation and provides practical insights.

Keywords: inventory liquidation, scalable computational approaches, dynamic programming, greedy heuristic, simulation, design science

Suggested Citation

Yang, Mochen and Adomavicius, Gediminas and Gupta, Alok, Efficient Computational Strategies for Dynamic Inventory Liquidation (September 1, 2018). Information Systems Research, Forthcoming, Kelley School of Business Research Paper No. 18-79, Available at SSRN: https://ssrn.com/abstract=3251519

Mochen Yang (Contact Author)

University of Minnesota - Twin Cities - Carlson School of Management ( email )

19th Avenue South
Minneapolis, MN 55455
United States

Gediminas Adomavicius

University of Minnesota - Twin Cities - Carlson School of Management ( email )

19th Avenue South
Minneapolis, MN 55455
United States

Alok Gupta

University of Minnesota - Twin Cities - Carlson School of Management ( email )

19th Avenue South
Minneapolis, MN 55455
United States

Do you want regular updates from SSRN on Twitter?

Paper statistics

Downloads
69
Abstract Views
584
rank
441,568
PlumX Metrics