The multi‐product multi‐constraint newsboy problem: Applications, formulation and solution
Hon‐Shiang Lau, Amy Hing‐Ling Lau
Abstract
Hon‐Shiang Lau, Amy Hing‐Ling Lau
Abstract
Abstract Practically all of the many earlier papers on the newsboy problem consider a single newsboy product with no capacity constraint. This paper points out the real‐world prevalence of the “multiple‐product multiple‐constraint newsboy problem”, i.e., the “newstand problem”. We present a formulation and a solution procedure for this newsstand problem. Our solutions procedure has been designed to efficiently handle the common situation where a large number of products are involved; this solution procedure is shown to be necessary for the practical solution of realistic newsstand problems.
OpenAlex reports 99 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Abstract Practically all of the many earlier papers on the newsboy problem consider a single newsboy product with no capacity constraint. This paper points out the real‐world prevalence of the “multiple‐product multiple‐constraint newsboy problem”, i.e., the “newstand problem”. We present a formulation and a solution procedure for this newsstand problem. Our solutions procedure has been designed to efficiently handle the common situation where a large number of products are involved; this solution procedure is shown to be necessary for the practical solution of realistic newsstand problems.
Key concepts: Newsvendor model, Constraint (computer-aided design), Product (mathematics), Mathematical optimization, Computer science, Mathematics, Supply chain, Business