A dynamic iteration algorithm of classic Newsboy Problem

This paper presents a new iterative method for the classic Newsboy Problem based on the dynamic programming principle. The optimal inventory of the classic Newsboy Problem then can be derived. It has been found that this method has fewer steps than those of others, with which the optimal inventory can be obtained more conveniently. This method applies to various distributions and provides a new way to apply and extend the Newsboy Problem.