IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v33y2016i02ns0217595916500123.html
   My bibliography  Save this article

A Goal Programming Model for Selection and Scheduling of Advertisements on Online News Media

Author

Listed:
  • Prerna Manik

    (Department of Operational Research, University of Delhi, Delhi, India)

  • Anshu Gupta

    (School of Business, Public Policy and Social Entrepreneurship, Ambedkar University, Delhi, India)

  • P. C. Jha

    (Department of Operational Research, University of Delhi, Delhi, India)

  • Kannan Govindan

    (Centre for Sustainable Engineering Operations Management, Department of Technology and Innovation, University of Southern Denmark, Denmark)

Abstract

Digital revolution has resulted in a paradigm shift in the field of marketing with online advertising becoming increasingly popular as it offers the reach, range, scale and interactivity to organizations to influence their target customers. Moreover, web advertisement is the primary revenue stream for several websites that provide free services to internet users. The website management team needs to do a lot of planning and optimally schedule various advertisements (ads) to maximize revenue, taking care of advertisers’ needs under system constraints. In this paper, we have considered the case of news websites that provide news to its viewers for free with ads as the primary source of their revenue. The considered news website consists of many webpages with different banners for advertisement. Each banner consists of different number of partitions and cost per partition varies for different rectangular banners. Many ads compete with each other for their placement on a webpage on a specific banner, based on partition requirement, at specific time interval(s). Here, we have formulated a mixed integer 0–1 linear programming advertisement scheduling problem to maximize the revenue over planning horizon divided into time intervals under various system and technical constraints. A case is presented to show the applicability of the model. Branch and bound integer programming and goal programming techniques have been used to solve the formulated problem.

Suggested Citation

  • Prerna Manik & Anshu Gupta & P. C. Jha & Kannan Govindan, 2016. "A Goal Programming Model for Selection and Scheduling of Advertisements on Online News Media," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(02), pages 1-41, April.
    • Handle: RePEc:wsi:apjorx:v:33:y:2016:i:02:n:s0217595916500123
    DOI: 10.1142/S0217595916500123
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595916500123
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595916500123?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. Syam Menon & Ali Amiri, 2004. "Scheduling Banner Advertisements on the Web," INFORMS Journal on Computing, INFORMS, vol. 16(1), pages 95-105, February.
    2. Patrali Chatterjee & Donna L. Hoffman & Thomas P. Novak, 2003. "Modeling the Clickstream: Implications for Web-Based Advertising Efforts," Marketing Science, INFORMS, vol. 22(4), pages 520-541, May.
    3. Kumar, Subodha & Sethi, Suresh P., 2009. "Dynamic pricing and advertising for web content providers," European Journal of Operational Research, Elsevier, vol. 197(3), pages 924-944, September.
    4. Kumar, Subodha & Jacob, Varghese S. & Sriskandarajah, Chelliah, 2006. "Scheduling advertisements on a web page to maximize revenue," European Journal of Operational Research, Elsevier, vol. 173(3), pages 1067-1089, 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. Adam Madleňák & Václav Kupec & Vladimíra Hladíková & Přemysl Písař & Michael Kupec, 2023. "Digitalisation as a Prerequisite for the Groundswell Concept Encouraging the Optimisation of Investments in Online Advertising Using an Audit Approach," Academic Journal of Interdisciplinary Studies, Richtmann Publishing Ltd, vol. 12, September.

    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. Selçuk, B. & Özlük, Ö., 2013. "Optimal keyword bidding in search-based advertising with target exposure levels," European Journal of Operational Research, Elsevier, vol. 226(1), pages 163-172.
    2. Hana Choi & Carl F. Mela & Santiago R. Balseiro & Adam Leary, 2020. "Online Display Advertising Markets: A Literature Review and Future Directions," Information Systems Research, INFORMS, vol. 31(2), pages 556-575, June.
    3. Shinjini Pandey & Goutam Dutta & Harit Joshi, 2017. "Survey on Revenue Management in Media and Broadcasting," Interfaces, INFORMS, vol. 47(3), pages 195-213, June.
    4. Sami Najafi-Asadolahi & Kristin Fridgeirsdottir, 2014. "Cost-per-Click Pricing for Display Advertising," Manufacturing & Service Operations Management, INFORMS, vol. 16(4), pages 482-497, October.
    5. Subodha Kumar & Xiaowei Mei & Liangfei Qiu & Lai Wei, 2020. "Watching Ads for Free Mobile Data: A Game-Theoretic Analysis of Sponsored Data with Reward Task," Working Papers 20-08, NET Institute.
    6. Lili Hai & Lan Zhao & Anna Nagurney, 2010. "An integrated framework for the design of optimal web banners," Netnomics, Springer, vol. 11(1), pages 69-83, April.
    7. Deane, Jason & Agarwal, Anurag, 2012. "Scheduling online advertisements to maximize revenue under variable display frequency," Omega, Elsevier, vol. 40(5), pages 562-570.
    8. Radha Mookerjee & Subodha Kumar & Vijay S. Mookerjee, 2017. "Optimizing Performance-Based Internet Advertisement Campaigns," Operations Research, INFORMS, vol. 65(1), pages 38-54, February.
    9. Zhen Sun & Milind Dawande & Ganesh Janakiraman & Vijay Mookerjee, 2017. "Not Just a Fad: Optimal Sequencing in Mobile In-App Advertising," Information Systems Research, INFORMS, vol. 28(3), pages 511-528, September.
    10. Radha Mookerjee & Subodha Kumar & Vijay S. Mookerjee, 2017. "Optimizing Performance-Based Internet Advertisement Campaigns," Operations Research, INFORMS, vol. 65(1), pages 38-54, February.
    11. Kumar, Subodha & Sethi, Suresh P., 2009. "Dynamic pricing and advertising for web content providers," European Journal of Operational Research, Elsevier, vol. 197(3), pages 924-944, September.
    12. Kursad Asdemir & Nanda Kumar & Varghese S. Jacob, 2012. "Pricing Models for Online Advertising: CPM vs. CPC," Information Systems Research, INFORMS, vol. 23(3-part-1), pages 804-822, September.
    13. Yiting Xing & Ling Li & Zhuming Bi & Marzena Wilamowska‐Korsak & Li Zhang, 2013. "Operations Research (OR) in Service Industries: A Comprehensive Review," Systems Research and Behavioral Science, Wiley Blackwell, vol. 30(3), pages 300-353, May.
    14. Rakesh R. Mallipeddi & Subodha Kumar & Chelliah Sriskandarajah & Yunxia Zhu, 2022. "A Framework for Analyzing Influencer Marketing in Social Networks: Selection and Scheduling of Influencers," Management Science, INFORMS, vol. 68(1), pages 75-104, January.
    15. John Turner, 2012. "The Planning of Guaranteed Targeted Display Advertising," Operations Research, INFORMS, vol. 60(1), pages 18-33, February.
    16. LEE, Janghyuk & BRILEY, Donnel A., 2005. "Repeat exposure effects of internet advertising," HEC Research Papers Series 809, HEC Paris.
    17. Anindya Ghose & Sha Yang, 2007. "An Empirical Analysis of Search Engine Advertising: Sponsored Search and Cross-Selling in Electronic Markets," Working Papers 07-35, NET Institute, revised Sep 2007.
    18. Hamed Ghoddusi & Alexander Rodivilov & Baran Siyahhan, 2019. "Two-sided markets : the role of technological uncertainty," Working Papers hal-02447328, HAL.
    19. Radha Mookerjee & Subodha Kumar & Vijay S. Mookerjee, 2012. "To Show or Not Show: Using User Profiling to Manage Internet Advertisement Campaigns at Chitika," Interfaces, INFORMS, vol. 42(5), pages 449-464, October.
    20. Bayer, Emanuel & Srinivasan, Shuba & Riedl, Edward J. & Skiera, Bernd, 2020. "The impact of online display advertising and paid search advertising relative to offline advertising on firm performance and firm value," International Journal of Research in Marketing, Elsevier, vol. 37(4), pages 789-804.

    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:wsi:apjorx:v:33:y:2016:i:02:n:s0217595916500123. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.