A note on the Optimal Periodic Pattern (OPP) algorithm for the system in which buyers periodically order from a vendor

In this study, we revisit research contributed by Afzalabadi et al. (2016), where a lot size problem for discrete periodic demand case was considered. Our note indicates incorrectness of the main thesis that the OPP algorithm finds the optimal solution in a finite number of steps. Numerical counterexamples with appropriate comments are presented. We also provide a reformulation of the model and proper conditions for optimality.