Finding optimal (s,S) policies is about as simple as evaluating a single policy

In this paper, a new algorithm for computing optimal (s,S) policies is derived based upon a number of new properties of the infinite horizon cost function c(s,S) as well as a new upper bound for optimal order-up-to levels S* and a new lower bound for optimal reorder levels s*. The algorithm is simple and easy to understand. Its computational complexity is only 2.4 times that required to evaluate a (specific) single (s,S) policy. The algorithm applies to both periodic review and continuous review inventory systems.