Estimating profitable price bounds for prescriptive price optimization
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912546456338432 |
|---|---|
| author | Inokuma, Masato Ikeda, Shunnosuke Takano, Yuichi |
| author_facet | Inokuma, Masato Ikeda, Shunnosuke Takano, Yuichi |
| contents | Pricing of products and services, which has a significant impact on consumer demand, is one of the most important factors in maximizing business profits. Prescriptive price optimization is a prominent data-driven pricing methodology consisting of two phases: demand forecasting and price optimization. In the practice of prescriptive price optimization, the price of each item is typically set within a predetermined range defined by lower and upper bounds. Narrow price ranges can lead to missed opportunities, while wide price ranges run the risk of proposing unrealistic prices; therefore, determining profitable price bounds while maintaining the reliability of the suggested prices is a critical challenge that directly affects the effectiveness of prescriptive price optimization. We propose two methods for estimating price bounds in prescriptive price optimization so that future total revenue derived from the optimized prices will be maximized. Our first method for price bounds estimation uses the bootstrap procedure to estimate confidence intervals for optimal prices. Our second method uses the Nelder--Mead simplex method for black-box price bounds optimization that maximizes total revenue estimated through $K$-fold cross-validation. Experimental results with synthetic price--demand datasets demonstrate that our methods successfully narrowed down the price range while maintaining high revenues, particularly when the number of items was small or the demand noise level was low. Moreover, as more data accumulated, the comparative advantage of our methods further increased. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_15248 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Estimating profitable price bounds for prescriptive price optimization Inokuma, Masato Ikeda, Shunnosuke Takano, Yuichi Optimization and Control Computational Engineering, Finance, and Science Pricing of products and services, which has a significant impact on consumer demand, is one of the most important factors in maximizing business profits. Prescriptive price optimization is a prominent data-driven pricing methodology consisting of two phases: demand forecasting and price optimization. In the practice of prescriptive price optimization, the price of each item is typically set within a predetermined range defined by lower and upper bounds. Narrow price ranges can lead to missed opportunities, while wide price ranges run the risk of proposing unrealistic prices; therefore, determining profitable price bounds while maintaining the reliability of the suggested prices is a critical challenge that directly affects the effectiveness of prescriptive price optimization. We propose two methods for estimating price bounds in prescriptive price optimization so that future total revenue derived from the optimized prices will be maximized. Our first method for price bounds estimation uses the bootstrap procedure to estimate confidence intervals for optimal prices. Our second method uses the Nelder--Mead simplex method for black-box price bounds optimization that maximizes total revenue estimated through $K$-fold cross-validation. Experimental results with synthetic price--demand datasets demonstrate that our methods successfully narrowed down the price range while maintaining high revenues, particularly when the number of items was small or the demand noise level was low. Moreover, as more data accumulated, the comparative advantage of our methods further increased. |
| title | Estimating profitable price bounds for prescriptive price optimization |
| topic | Optimization and Control Computational Engineering, Finance, and Science |
| url | https://arxiv.org/abs/2508.15248 |