کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
482426 | 1446208 | 2007 | 15 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: Using separable programming to solve the multi-product multiple ex-ante constraint newsvendor problem and extensions Using separable programming to solve the multi-product multiple ex-ante constraint newsvendor problem and extensions](/preview/png/482426.png)
This paper provides an approximating programming technique to solve the multi-product newsvendor model in which product demands are independent and stocking quantities are subject to two or more ex-ante linear contraints, such as budget or volume constraints. Previous research has attempted to solve this problem with Lagrange relaxation techniques or by limiting the distribution of demand. However, by taking advantage of the separable nature of the problem, a close approximation of the optimal solution can be found using convex separable programming for any demand distribution in the traditional newsvendor model and extensions. Sensitivity analysis of the linear program provides managerial insight into the effects of parameters of the problem on the optimal solution and future decisions.
Journal: European Journal of Operational Research - Volume 176, Issue 2, 16 January 2007, Pages 941–955