IDEAS home Printed from https://ideas.repec.org/a/hin/jnddns/7674027.html
   My bibliography  Save this article

Multiproduct Multiperiod Newsvendor Problem with Dynamic Market Efforts

Author

Listed:
  • Jianmai Shi
  • Yiping Bao

Abstract

We study a multiperiod multiproduct production planning problem where the production capacity and the marketing effort on demand are both considered. The accumulative impact of marketing effort on demand is captured by the Nerlove and Arrow (N-A) advertising model. The problem is formulated as a discrete-time, finite-horizon dynamic optimization problem, which can be viewed as an extension to the classic newsvendor problem by integrating with the N-A model. A Lagrangian relaxation based solution approach is developed to solve the problem, in which the subgradient algorithm is used to find an upper bound of the solution and a feasibility heuristic algorithm is proposed to search for a feasible lower bound. Twelve kinds of instances with different problem size involving up to 50 products and 15 planning periods are randomly generated and used to test the Lagrangian heuristic algorithm. Computational results show that the proposed approach can obtain near optimal solutions for all the instances in very short CPU time, which is less than 90 seconds even for the largest instance.

Suggested Citation

  • Jianmai Shi & Yiping Bao, 2016. "Multiproduct Multiperiod Newsvendor Problem with Dynamic Market Efforts," Discrete Dynamics in Nature and Society, Hindawi, vol. 2016, pages 1-10, October.
    • Handle: RePEc:hin:jnddns:7674027
    DOI: 10.1155/2016/7674027
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/DDNS/2016/7674027.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/DDNS/2016/7674027.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2016/7674027?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
    ---><---

    Citations

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


    Cited by:

    1. Hrabec, Dušan & Kučera, Jiří & Martinek, Pavel, 2023. "Marketing effort within the newsvendor problem framework: A systematic review and extensions of demand-effort and cost-effort formulations," International Journal of Production Economics, Elsevier, vol. 257(C).
    2. João M. C. Sousa & Rodrigo Luís & Rui Mirra Santos & Luís Mendonça & Susana M. Vieira, 2024. "Fuzzy Multi-Item Newsvendor Problem: An Application to Inventory Management," Mathematics, MDPI, vol. 12(11), pages 1-18, May.

    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:hin:jnddns:7674027. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.