Skip to main content
Log in

Maximum utility product pricing models and algorithms based on reservation price

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

We consider a revenue management model for pricing a product line with several customer segments under the assumption that customers’ product choices are determined entirely by their reservation prices. We highlight key mathematical properties of the maximum utility model and formulate it as a mixed-integer programming problem, design heuristics and valid cuts. We further present extensions of the models to deal with various practical issues arising in applications. Our computational experiments with real data from the tourism sector as well as with the randomly generated data show the effectiveness of our approach.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Aydin, G., Ryan, J.K.: Product line selection and pricing under the multinomial logit choice model. Working paper, Stanford University (2000)

  2. Barahona, F., Tardos, É.: Note on Weintraub’s minimum cost circulation algorithm. SIAM J. Comput. 18, 579–583 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  3. Bienstock, D., McClosky, B.: Tightening simple mixed-integer sets with guaranteed bounds. Research Report, Columbia University, NY, USA (July 2008)

  4. Dobson, G., Kalish, S.: Positioning and pricing a product line. Mark. Sci. 7, 107–125 (1988)

    Article  Google Scholar 

  5. Dobson, G., Kalish, S.: Heuristics for pricing and positioning a product-line using conjoint and cost data. Manag. Sci. 39, 160–175 (1993)

    Article  Google Scholar 

  6. Dussault, J.-P., Marcotte, P., Roch, S., Savard, G.: A smoothing heuristic for a bilevel pricing problem. Eur. J. Oper. Res. 174, 1396–1413 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  7. Gu, Z., Nemhauser, G.L., Savelsbergh, M.W.P.: Lifted flow cover inequalities for mixed 0-1 integer programs. Math. Program. 85, 439–467 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  8. Guruswami, V., Hartline, J., Karlin, A., Kempe, D., Kenyon, C., McSherry, F.: On profit-maximizing envy-free pricing. In: SODA, 2005

  9. Hanson, W., Martin, R.K.: Optimal bundle pricing. Manag. Sci. 36, 155–174 (1990)

    Article  MATH  Google Scholar 

  10. ILOG: CPLEX 9.1 User Manual

  11. Kalish, S., Nelson, P.: A comparison of ranking, rating and reservation price measurement in conjoint analysis. Mark. Lett. 2, 327–335 (1991)

    Article  Google Scholar 

  12. Kamakura, W.A., Russell, G.J.: A probabilistic choice model for market segmentation and elasticity structure. J. Mark. Res. 26, 379–390 (1989)

    Article  Google Scholar 

  13. Kohli, R., Mahajan, V.: A reservation-price model for optimal pricing of multiattribute products in conjoint analysis. J. Mark. Res. 28, 347–354 (1991)

    Article  Google Scholar 

  14. Kraus, U.G., Yano, C.A.: Product line selection and pricing under a share-of-surplus choice model. Eur. J. Oper. Res. 150, 653–671 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  15. Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley, New York (1988)

    MATH  Google Scholar 

  16. Padberg, M.W., Van Roy, T.J., Wolsey, L.A.: Valid inequalities for fixed charge problems. Oper. Res. 33, 842–861 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  17. Rusmevichientong, P., Van Roy, B., Glynn, P.W.: A nonparametric approach to multiproduct pricing. Oper. Res. 54, 82–98 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  18. Schniederjans, M.J.: Goal Programming: Methodology and Applications. Kluwer, Boston (1995)

    MATH  Google Scholar 

  19. Shioda, R., Tunçel, L., Hui, B.: Applications of deterministic optimization techniques to some probabilistic choice models for product pricing based on reservation prices. Research Report, Department of Combinatorics and Optimization, Faculty of Mathematics, University of Waterloo, CORR 2007-02 (2007)

  20. Van Ryzin, G., Talluri, K.T.: The Theory and Practice of Revenue Management. Kluwer Academic, Dordrecht (2004)

    MATH  Google Scholar 

  21. Weintraub, A.: A primal algorithm to solve network flow problems with convex costs. Manag. Sci. 21, 87–97 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  22. Wolsey, L.A.: Integer Programming. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley, New York (1998)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to L. Tunçel.

Additional information

Research supported in part by Discovery Grants from NSERC, a research grant from Air Canada Vacations and by a Collaborative Research and Development Grant from NSERC.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shioda, R., Tunçel, L. & Myklebust, T.G.J. Maximum utility product pricing models and algorithms based on reservation price. Comput Optim Appl 48, 157–198 (2011). https://doi.org/10.1007/s10589-009-9254-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10589-009-9254-5

Keywords

Navigation