Article ID: | iaor20164185 |
Volume: | 62 |
Issue: | 8 |
Start Page Number: | 2437 |
End Page Number: | 2455 |
Publication Date: | Aug 2016 |
Journal: | Management Science |
Authors: | Duenyas Izak, Jasin Stefanus, Chen Qi (George) |
Keywords: | inventory, programming: dynamic, combinatorial optimization, heuristics, marketing |
We study a standard dynamic pricing problem where the seller (a monopolist) possesses a finite amount of inventories and attempts to sell the products during a finite selling season. Despite the potential benefits of dynamic pricing, many sellers still adopt a static pricing policy because of (1) the complexity of frequent reoptimizations, (2) the negative perception of excessive price adjustments, and (3) the lack of flexibility caused by existing business constraints. In this paper, we develop a family of pricing heuristics that can be used to address all these challenges. Our heuristic is computationally easy to implement; it requires only a single optimization at the beginning of the selling season and automatically adjusts the prices over time. Moreover, to guarantee a strong revenue performance, the heuristic only needs to adjust the prices of a