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

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

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

In this paper we introduce several classes of generalized convex functions already discussed in the literature and show the relation between those function classes. Moreover, for some of those function classes a Farkas-type theorem is proved. As such this paper unifies and extends results...

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.<BR> For compound Poisson demand with discrete order sizes, we show how to determine the expected costs and the optimal cutoff...