A binary solution method for the multi-product newsboy problem with budget constraint

Multi-product newsboy problem (MPNP) with budget constraint is a classical inventory control/management problem. However, solution methods for MPNP under general demand distributions are limited in the current literature. In this paper, by analyzing properties of the optimal solution to the MPNP with a budget constraint, we develop a solution algorithm for the constrained MPNP. The proposed algorithm is binary in nature, and is applicable to general types of demand distribution functions, discrete as well as continuous. For continuous demand distribution function, our approach can obtain the optimal or near optimal solution to the constrained MPNP with polynomial computation complexity of the o(n) order. On the other hand, for discrete demand distribution functions, it can effectively provide good approximate solution. Numerical experiments are presented to show the performance of our method.

[1]  Layek L. Abdel-Malek,et al.  Production , Manufacturing and Logistics A quadratic programming approach to the multi-product newsvendor problem with side constraints , 2006 .

[2]  M. Khouja.  The single-period (news-vendor) problem: literature review and suggestions for future research , 1999 .

[3]  A. Lau,et al.  The multi-product multi-constraint newsboy problem: Applications, formulation and solution , 1995 .

[4]  Zhongsheng Hua,et al.  A hybrid support vector machines and logistic regression approach for forecasting intermittent demand of spare parts , 2006, Appl. Math. Comput..

[5]  George L. Vairaktarakis,et al.  Robust multi-item newsboy models with a budget constraint , 2000 .

[6]  Zhongsheng Hua,et al.  A unified method for a class of convex separable nonlinear knapsack problems , 2008, Eur. J. Oper. Res..

[7]  A. Lau,et al.  The newsstand problem: A capacitated multiple-product single-period inventory problem , 1996 .

[8]  Roberto Montanari,et al.  On the multi-product newsboy problem with two constraints , 2005, Comput. Oper. Res..

[9]  Arthur F. Veinott,et al.  Analysis of Inventory Systems , 1963 .

[10]  G. Gallego,et al.  The Distribution Free Newsboy Problem: Review and Extensions , 1993 .

[11]  Layek Abdel-Malek,et al.  Exact, approximate, and generic iterative models for the multi-product Newsboy problem with budget constraint , 2004 .

[12]  Zhongsheng Hua,et al.  An approximate dynamic programming approach to convex quadratic knapsack problems , 2006, Comput. Oper. Res..

[13]  Layek Abdel-Malek,et al.  The capacitated newsboy problem with random yield: The Gardener Problem , 2008 .

[14]  Abdul Raouf,et al.  On the Constrained Multi‐item Single‐period Inventory Problem , 1993 .

[15]  Edward A. Silver,et al.  The multi-item newsvendor problem with a budget constraint and fixed ordering costs , 2000, J. Oper. Res. Soc..

[16]  Layek Abdel-Malek,et al.  An analysis of the multi-product newsboy problem with a budget constraint , 2005 .

[17]  J. Yang,et al.  A new approach of forecasting intermittent demand for spare parts inventories in the process industries , 2007, J. Oper. Res. Soc..

[18]  Steven J. Erlebacher.  OPTIMAL AND HEURISTIC SOLUTIONS FOR THE MULTI‐ITEM NEWSVENDOR PROBLEM WITH A SINGLE CAPACITY CONSTRAINT , 2000 .