IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2507.09635.html
   My bibliography  Save this paper

Selective Newsvendor Problem with Dependent Leadtime and Joint Marketing Decisions

Author

Listed:
  • Jianing Zhi
  • Guanqiu Qi
  • Xinghua Li

Abstract

In this paper, we investigate a joint decision-making pattern for a two-stage supply chain network, including a supplier, a company, and its customers. We investigate two types of demand patterns, associated with dependent lead time and service level considerations. We define two novel models, including all-or-nothing selective newsvendor problem (AON-SNP) and selective news Vendor Problem with Dependent Lead Time and Price Related Demands (DLSNP). The proposed models are applicable to numerous areas such as the fashion, furniture, and electronic industries. We develop an efficient solution algorithm, referred to as R-search, to identify an optimal solution for the DL-selectivity problem. We examine various responses of the system through parameter sensitivity analysis. Our model proves that if the total demand is lower than the upper limit of the order quantity, the best strategy for Q is to match that demand. If the market increases, more demand comes in, leading to a shortage, and forcing the company to find other local suppliers to fill the additional demand. The results demonstrate that our model well explains various behavior for all involved parties in the network, and provide guidance on intelligent decision making for the company.

Suggested Citation

  • Jianing Zhi & Guanqiu Qi & Xinghua Li, 2025. "Selective Newsvendor Problem with Dependent Leadtime and Joint Marketing Decisions," Papers 2507.09635, arXiv.org.
  • Handle: RePEc:arx:papers:2507.09635
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2507.09635
    File Function: Latest version
    Download Restriction: no
    ---><---

    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:arx:papers:2507.09635. 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: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    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.