This paper studies the optimization of the (S, T) inventory policy, where T is the replenishment interval and S is the order‐up‐to level. First, we demonstrate that the previously established joint convexity of the long‐run average cost is false. Hence, the optimization is not straightforward. We then point out that the joint convexity concept depends on whether S and T are continuous or discrete variables, and in some situations it may not even be well defined. Nonetheless, we are able to identify several useful properties of the cost function, such as submodularity and coordinatewise convexity. Based on these properties, we develop efficient algorithms to compute the optimal policy for continuous and discrete demands.
