In most multi-item inventory systems, the ordering costs consist of a major cost and a minor cost for each item included. Applying for every individual item a cyclic inventory policy, where the cycle length is a multiple of some basic cycle time, reduces the major ordering costs. An efficient...

In this paper we analyse the effect of satisfying in a different way customers with an order larger than a prespecified cutoff transaction size, in a simple newsboy setting.For compound Poisson demand with discrete order sizes, we show how to determine the expected costs and the optimal cutoff...

In this paper an inventory model with several demand classes, prioritised according to importance, is analysed. We consider a lot-for-lot or (S-1,S) inventory model with lost sales.For each demand class there is a critical stock level at and below which demand from that class is not satisfied...

In this paper the well-known minimax theorems of Wald, Ville and Von Neumann are generalized under weaker topological conditions on the payoff function f and/or extended to the larger set of the Borel probability measures instead of the set of mixed strategies.

In this paper we review known minimax results with applications in game theory and showthat these results are easy consequences of the first minimax result for a two person zero sumgame with finite strategy sets published by von Neumann in 1928. Among these results are thewell known minimax...

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...

In this paper we introduce several classes of generalized convexfunctions already discussed in the literature and show the relationbetween those function classes. Moreover, for some of those functionclasses a Farkas-type theorem is proved. As such this paper unifiesand extends results existing...