The most recent optimization algorithm for (s, S) order policies with continuous demand was developed byFedergruen and Zipkin (1985). This was also the first efficient algorithm, which uses policy iteration instead ofdiscretization. Zheng and Federgruen (1991) developed an even more efficient...

In this paper we present two general results on the existence of a discrete zero point of a function from the n-dimensional integer lattice Zn to the n-dimensional Euclidean space Rn. Under two different boundary conditions, we give a constructive proof using a combinatorial argument based on a...

We consider the classical duality operators for convex objects suchas the polar of a convex set containing the origin, the dual norm,the Fenchel-transform of a convex function and the conjugate of aconvex cone. We give a new, sharper, unified treatment of the theoryof these operators, deriving...