Usulan Model Robust Newsvendor Problem Untuk Multi Produk dan Mempertimbangkan Permintaan Diskrit (Studi Kasus: Toko Roti X di Bandung)

Fran Setiawan, Paulina Kus Ariningsih, Stefanie Widya


In Indonesia, the number of businesses that do not have a special building is 18.9 million business. One business that does not have a special building is a peddler. A considerable number of peddlers make the productivity and competitiveness of peddlers need to be improved. The problem faced by the peddler is to determine the type and the amount of each type of goods that must be brought each day. If the goods brought too many can cause overstocks that result in remaining goods can not be sold in the next sales period. If the goods brought too few can cause shortages that can lead to loss of opportunities to make sales or profit for a particular type of goods in a particular region. In this research, this problem will be modeled as a robust multi-product newsvendor problem with discrete demand. This model determines the optimal number that everyday peddler must bring for each type of product that maximizes the expected profit from the worst possibility that can occur when only some information from the demand distribution is known. After developing the model, then made a model completion program using Octave software. The case study used in this research is peddler of a bakery shop in Bandung. The results of the implementation of the developed model can increase the average of expected profit obtained by the first and second peddlers by 126.77% and 268.3987% respectively of the average current profit earned by the both peddlers.


pedagang keliling, robust, multiproduct newsvendor problem, discrete demand


Choi, T-M. (2012). Handbook of Newsvendor Problem: Models, Extensions and Applications. International Series in Operations Research & Management Science, Springer, New York.

Gallego, G. and Moon, I. (1993). The distribution free newsboy problem: review and extensions. Journal of the Operational Research Society, Vol 44(8), hal.825-834.

Qin, Y., Wang, R., Vakharia, A.J., Chen, Y., Seref, M.M.H. (2011). The Newsvendor Problem: Review and Directions for Future Research. European Journal of Operational Research, 213, hal.361-374.

Scarf, H. (1958). A min-max solution of an inventory problem. in Arrow, K., Karlin. S., and Scarf, H. Studies in The Mathematical Theory of Inventory and Production. Stanford University Press, California.

Turken, N., Tan, Y., Vakharia, A.J., Wang, L., Wang, R., Yenipazarli, A. (2012). The Multi-product Newsvendor Problem: Review, Ekstension, and Directions for Future Research. Handbook of Newsvendor Problem: Models, Extensions and Applications, Springer, New York.

Yu, H., Zhai, Jia., Sun, C. (2014). Robust Newsvendor Problem with Discrete Demand. 11th International Conference on Service System and Service Management (ICSSSM), IEEE, Beijing, China.


  • There are currently no refbacks.