The robust min-max newsvendor problem with balking under a service level constraint

Taesu Cheong, Kysang Kwon

Research output: Contribution to journalArticlepeer-review

5 Citations (Scopus)

Abstract

In this paper we study an extension of a classic newsvendor model with balking under a service-level constraint. We also relax the assumption that the demand distribution is fully available to a decision-maker; we assume that only the mean and variance of the demand distribution are known, and discuss the procedure for determining the optimal order quantity for the concomitant model. We further extend our base model to two different cases: (i) when the fixed ordering cost is included, and (ii) when yield is uncertain. We illustrate the solution procedures for each case with numerical examples. Moreover, we discuss the performance and robustness of the approach through randomly generated test instances, and perform a numerical sensitivity analysis to evaluate the impact of the changes of a targeted fill-rate and variances of a demand distribution.

Original languageEnglish
Pages (from-to)83-97
Number of pages15
JournalSouth African Journal of Industrial Engineering
Volume24
Issue number3
DOIs
Publication statusPublished - 2013 Nov
Externally publishedYes

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering

Fingerprint

Dive into the research topics of 'The robust min-max newsvendor problem with balking under a service level constraint'. Together they form a unique fingerprint.

Cite this