IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v55y2017i1p3-17.html
   My bibliography  Save this article

Heuristic solution to the product targeting problem based on mathematical programming

Author

Listed:
  • Filiz Cetin
  • Cigdem Alabas-Uslu

Abstract

Maintaining customer lifetime longevity is a crucial issue for companies. One of the strategies for dealing with this issue is to offer different promotion campaigns. Planning these campaigns creates a problem: Which targeted products in the campaign should be offered to which customers in order to maximise profit? This problem becomes vitally important under the conditions of a limited budget and a lower bound on sales target of each product. It is also remarkable from the operational research perspective because of its NP-hardness. In this study, heuristic approaches to the product targeting problem based on mathematical programming are suggested. The proposed approaches principally determine the products to be included in a campaign using heuristic rules and then distribute these products to the customers optimally. Computational results confirm that these approaches generate superior solutions to the problem in comparison with existing methods in the literature. The effectiveness and efficiency of the approaches are also shown on very large-sized test problems generated in order to verify their potential for practical applications.

Suggested Citation

  • Filiz Cetin & Cigdem Alabas-Uslu, 2017. "Heuristic solution to the product targeting problem based on mathematical programming," International Journal of Production Research, Taylor & Francis Journals, vol. 55(1), pages 3-17, January.
    • Handle: RePEc:taf:tprsxx:v:55:y:2017:i:1:p:3-17
    DOI: 10.1080/00207543.2015.1112047
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2015.1112047
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2015.1112047?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.

    Citations

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


    Cited by:

    1. Bigler, T. & Kammermann, M. & Baumann, P., 2023. "A matheuristic for a customer assignment problem in direct marketing," European Journal of Operational Research, Elsevier, vol. 304(2), pages 689-708.
    2. Mehrdad Memarpour & Erfan Hassannayebi & Navid Fattahi Miab & Ali Farjad, 2021. "Dynamic allocation of promotional budgets based on maximizing customer equity," Operational Research, Springer, vol. 21(4), pages 2365-2389, December.

    More about this item

    Statistics

    Access and download statistics

    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:taf:tprsxx:v:55:y:2017:i:1:p:3-17. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.