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.
Year of publication: |
2009
|
---|---|
Authors: | Zhang, Bin ; Xu, Xiaoyan ; Hua, Zhongsheng |
Published in: |
International Journal of Production Economics. - Elsevier, ISSN 0925-5273. - Vol. 117.2009, 1, p. 136-141
|
Publisher: |
Elsevier |
Subject: | Newsboy problem Budget constraint Optimization |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
A binary solution method for the multi-product newsboy problem with budget constraint
Zhang, Bin, (2009)
-
A binary solution method for the multi-product newsboy problem with budget constraint
Zhang, Bin, (2009)
-
A binary solution method for the multi-product newsboy problem with budget constraint
Zhang, Bin, (2009)
- More ...