کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
5082055 | 1477627 | 2009 | 6 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A binary solution method for the multi-product newsboy problem with budget constraint
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
سایر رشته های مهندسی
مهندسی صنعتی و تولید
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
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.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: International Journal of Production Economics - Volume 117, Issue 1, January 2009, Pages 136-141
Journal: International Journal of Production Economics - Volume 117, Issue 1, January 2009, Pages 136-141
نویسندگان
Bin Zhang, Xiaoyan Xu, Zhongsheng Hua,