Robust personalized pricing under uncertainty of purchase probabilities
This paper is concerned with personalized pricing models aimed at maximizing the expected revenues or profits for a single item. While it is essential for personalized pricing to predict the purchase probabilities for each consumer, these predicted values are inherently subject to unavoidable predic...
Saved in:
Published in | EURO journal on computational optimization Vol. 13; p. 100114 |
---|---|
Main Authors | , , , |
Format | Journal Article |
Language | English |
Published |
Elsevier B.V
2025
Elsevier |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | This paper is concerned with personalized pricing models aimed at maximizing the expected revenues or profits for a single item. While it is essential for personalized pricing to predict the purchase probabilities for each consumer, these predicted values are inherently subject to unavoidable prediction errors that can negatively impact the realized revenues and profits. To resolve this challenge, we focus on robust optimization techniques that yield reliable solutions to optimization problems under uncertainty. Specifically, we propose a robust optimization model for personalized pricing that accounts for the uncertainty of predicted purchase probabilities. This model can be formulated as a mixed-integer linear optimization problem, which can be solved exactly using mathematical optimization solvers. We also develop a Lagrangian decomposition algorithm combined with the golden section search to efficiently find high-quality solutions to large-scale problems. Experimental results demonstrate the effectiveness of our robust optimization model and highlight the utility of our Lagrangian decomposition algorithm in terms of both computational efficiency and solution quality.
•Robust optimization model for personalized pricing considering prediction uncertainty.•Mixed-integer linear optimization formulation for robust personalized pricing.•Scalable algorithm using Lagrangian decomposition and golden section search.•Effectiveness of our pricing framework evaluated through computational experiments. |
---|---|
ISSN: | 2192-4406 |
DOI: | 10.1016/j.ejco.2025.100114 |