Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1142504 | Operations Research Letters | 2012 | 5 Pages |
Abstract
We consider a dynamic pricing problem for a company that sells a single product to a group of price-sensitive customers over a finite time horizon. The objective is to set the prices over time so as to maximize revenue. Two price-sensitivity models are studied: multiplicative and additive demand change. We develop a polynomial-time algorithm for the multiplicative model. In contrast, we prove that the problem under additive demand change is NP-hard and admits an FPTAS.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Sebastián Marbán, Ruben van der Zwaan, Alexander Grigoriev, Benjamin Hiller, Tjark Vredeveld,