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

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 which will appear as a chapter in the Handbook ofGeneralized Convexity we discuss the basic ideas ofconvex and quasiconvex analysis in finite dimensional Euclideanspaces. To illustrate the usefulness of this branchof mathematics also applications to optimization theory...