IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v196y2009i2p682-687.html
   My bibliography  Save this article

Incremental discount policy of cell-phone carrier with connection success rate constraint

Author

Listed:
  • Kim, Young Joo
  • Hwang, Hark

Abstract

Korean mobile carriers have implemented various service plans to gain additional market share. One of them is incremental discount policy on the call rate in which subscriber pays less for calls longer than a prescribed length. In this paper, a mathematical model is developed to find an optimal discount policy with the objective of maximizing the carrier's average expected revenue while satisfying a prescribed connection success rate. Through the analysis of the objective function we find a reduced solution space in which an optimal solution can be found by a search method. Through solving example problems the validity of the model is illustrated.

Suggested Citation

  • Kim, Young Joo & Hwang, Hark, 2009. "Incremental discount policy of cell-phone carrier with connection success rate constraint," European Journal of Operational Research, Elsevier, vol. 196(2), pages 682-687, July.
    • Handle: RePEc:eee:ejores:v:196:y:2009:i:2:p:682-687
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(08)00301-9
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Ronald W. Wolff, 1982. "Poisson Arrivals See Time Averages," Operations Research, INFORMS, vol. 30(2), pages 223-231, April.
    2. Peter J. Danaher, 2002. "Optimal Pricing of New Subscription Services: Analysis of a Market Experiment," Marketing Science, INFORMS, vol. 21(2), pages 119-138, February.
    3. Dipak C. Jain & Eitan Muller & Naufel J. Vilcassim, 1999. "Pricing Patterns of Cellular Phones and Phonecalls: A Segment-Level Analysis," Management Science, INFORMS, vol. 45(2), pages 131-141, February.
    4. Kim, Kap H. & Hwang, Hark, 1988. "An incremental discount pricing schedule with multiple customers and single price break," European Journal of Operational Research, Elsevier, vol. 35(1), pages 71-79, April.
    5. Rubin, Paul A. & Benton, W. C., 2003. "Evaluating jointly constrained order quantity complexities for incremental discounts," European Journal of Operational Research, Elsevier, vol. 149(3), pages 557-570, September.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Chen, Claire Y.T. & Sun, Edward W. & Miao, Wanyu & Lin, Yi-Bing, 2024. "Reconciling business analytics with graphically initialized subspace clustering for optimal nonlinear pricing," European Journal of Operational Research, Elsevier, vol. 312(3), pages 1086-1107.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Kim, Young-Joo & Hwang, Hark, 2008. "Incremental discount policy for taxi fare with price-sensitive demand," International Journal of Production Economics, Elsevier, vol. 112(2), pages 895-902, April.
    2. Vidyanand Choudhary, 2010. "Use of Pricing Schemes for Differentiating Information Goods," Information Systems Research, INFORMS, vol. 21(1), pages 78-92, March.
    3. Mesak, Hani I. & Bari, Abdullahel & Babin, Barry J. & Birou, Laura M. & Jurkus, Anthony, 2011. "Optimum advertising policy over time for subscriber service innovations in the presence of service cost learning and customers' disadoption," European Journal of Operational Research, Elsevier, vol. 211(3), pages 642-649, June.
    4. Tetsuji Hirayama, 2003. "Mean sojourn times in multiclass feedback queues with gated disciplines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(7), pages 719-741, October.
    5. Schlereth, Christian & Stepanchuk, Tanja & Skiera, Bernd, 2010. "Optimization and analysis of the profitability of tariff structures with two-part tariffs," European Journal of Operational Research, Elsevier, vol. 206(3), pages 691-701, November.
    6. Tsai, Jung-Fa, 2007. "An optimization approach for supply chain management models with quantity discount policy," European Journal of Operational Research, Elsevier, vol. 177(2), pages 982-994, March.
    7. Mohebbi, E., 2008. "A note on a production control model for a facility with limited storage capacity in a random environment," European Journal of Operational Research, Elsevier, vol. 190(2), pages 562-570, October.
    8. Huseyin C. Ozmutlu, 2009. "Markovian analysis for automatic new topic identification in search engine transaction logs," Applied Stochastic Models in Business and Industry, John Wiley & Sons, vol. 25(6), pages 737-768, November.
    9. San-José, Luis A. & García-Laguna, Juan, 2009. "Optimal policy for an inventory system with backlogging and all-units discounts: Application to the composite lot size model," European Journal of Operational Research, Elsevier, vol. 192(3), pages 808-823, February.
    10. Ting Zhu & Hongju Liu & Pradeep Chintagunta, 2015. "Wireless Carriers’ Exclusive Handset Arrangements: an Empirical Look at the iPhone," Customer Needs and Solutions, Springer;Institute for Sustainable Innovation and Growth (iSIG), vol. 2(2), pages 177-190, June.
    11. Peters, Kay & Albers, Sönke & Kumar, V., 2008. "Is there more to international Diffusion than Culture? An investigation on the Role of Marketing and Industry Variables," EconStor Preprints 27678, ZBW - Leibniz Information Centre for Economics.
    12. Duan, Lisha & Ventura, José A., 2019. "A Dynamic Supplier Selection and Inventory Management Model for a Serial Supply Chain with a Novel Supplier Price Break Scheme and Flexible Time Periods," European Journal of Operational Research, Elsevier, vol. 272(3), pages 979-998.
    13. Konstantin Kogan, 2019. "Discounting revisited: evolutionary perspectives on competition and coordination in a supply chain with multiple retailers," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 27(1), pages 69-92, March.
    14. Anindya Ghose & Sang Pil Han, 2014. "Estimating Demand for Mobile Applications in the New Economy," Management Science, INFORMS, vol. 60(6), pages 1470-1488, June.
    15. Zsolt Saffer & Sergey Andreev & Yevgeni Koucheryavy, 2016. "$$M/D^{[y]}/1$$ M / D [ y ] / 1 Periodically gated vacation model and its application to IEEE 802.16 network," Annals of Operations Research, Springer, vol. 239(2), pages 497-520, April.
    16. Jackson, Jonathan E. & Munson, Charles L., 2016. "Shared resource capacity expansion decisions for multiple products with quantity discounts," European Journal of Operational Research, Elsevier, vol. 253(3), pages 602-613.
    17. Zhou, Yong-Wu, 2009. "Two-echelon supply chain coordination through the unified number of annual orders," International Journal of Production Economics, Elsevier, vol. 117(1), pages 162-173, January.
    18. Roland T. Rust & Tuck Siong Chung, 2006. "Marketing Models of Service and Relationships," Marketing Science, INFORMS, vol. 25(6), pages 560-580, 11-12.
    19. Muller, Eitan, 2020. "Delimiting disruption: Why Uber is disruptive, but Airbnb is not," International Journal of Research in Marketing, Elsevier, vol. 37(1), pages 43-55.
    20. Josh Reed & Bo Zhang, 2017. "Managing capacity and inventory jointly for multi-server make-to-stock queues," Queueing Systems: Theory and Applications, Springer, vol. 86(1), pages 61-94, June.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:196:y:2009:i:2:p:682-687. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.