Online ordering rules for the multi-period newsvendor problem with quantity discounts

Yong Zhang (), Xingyu Yang (), Weiguo Zhang () and Weiwei Chen ()
Additional contact information
Yong Zhang: Guangdong University of Technology
Xingyu Yang: Guangdong University of Technology
Weiguo Zhang: South China University of Technology
Weiwei Chen: Rutgers University

Annals of Operations Research, 2020, vol. 288, issue 1, No 20, 495-524

Abstract: Abstract In this paper, we study the multi-period newsvendor problem with quantity discounts and stationary demand, where order quantities need to be decided sequentially over a finite or infinite horizon without making statistical assumption on demands. The Weak Aggregating Algorithm (WAA), which is an online learning method of prediction with expert advice, is applied to the problem. We first consider the all-unit discount case, in which the reduced unit cost is applied to all units in an order. We present explicit online ordering rules by using the fixed-stock strategy as expert advice during the application of WAA. A modified gain function implying convoluted contracts between the newsvendor and his supplier is defined to obtain some theoretical guarantees, which ensure that the newsvendor’s average gains are almost as large as those from the best expert advice for a sufficiently large horizon. Further, we generalize the results to the multi-level incremental discount case, in which there are different unit costs for different quantity ranges. We also extend the results to cases where order quantities are integer-valued, and provide correspondingly online ordering rules and theoretical guarantees. Finally, numerical experiments are performed and show that the average gains obtained by the proposed online ordering rules are comparable to those offered by the best experts in hindsight. The results also indicate that the cumulative gains achieved by the ordering rules for the problem with all-unit discount are larger than those achieved by the ordering rules for the problem with incremental discount; and order quantities increase with the discount level for the all-unit discount while decrease for the incremental discount. The results obtained in this paper can provide competitive online ordering rules for industry managers who need to place long-term continuous orders for perishable products when the demand distribution is unknown.

Keywords: Online learning; Multi-period newsvendor problem; Quantity discount; Online ordering rules; Weak Aggregating Algorithm (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://link.springer.com/10.1007/s10479-020-03551-6 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:288:y:2020:i:1:d:10.1007_s10479-020-03551-6

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-020-03551-6

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().