The non-stationary gamma process is a non-decreasing stochastic process with independent increments. By this monotonic behavior this stochastic process serves as a natural candidate for modelling time-dependent phenomena such as degradation. In condition-based maintenance the first time such a...

We present a thorough analysis of the economic order quantity model with shortages under a general inventory cost rate function and concave production costs. By using some standard results from convex analysis, we show that the model exhibits a composite concave-convex structure. Consequently,...

We consider equilibrium constrained optimization problems, which have a general formulationthat encompasses well-known models such as mathematical programs with equilibrium constraints, bilevel programs, and generalized semi-infinite programming problems. Based on the celebrated K K M lemma, we...

In this paper we will show that the closely K-convexlike vector-valued functions with K Rm a nonempty convex cone and related classes of vector-valued functions discussed in the literature arise naturally within the theory of biconjugate functions applied to the Lagrangian perturbation scheme in...

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

In this note we show that the strong duality theorem of an unconstrained (generalized) geometric programming problem as defined by Peterson (cf.[1]) is actually a special case of a Lagrangian duality result. Contrary to [1] we also consider the case that the set C is compact and convex and in...

In this paper we introduce robust versions of the classical static and dynamic single leg seat allocation models as analyzed by Wollmer, and Lautenbacher and Stidham, respectively. These robust models take into account the inaccurate estimates of the underlying probability distributions. As...

In this note we review some known minimax theorems with applications in game theory and show that these results form an equivalent chain which includes the strong separation result in finite dimensional spaces between two disjoint closed convex sets of which one is compact. By simplifying the...

In this chapter we give an overview on the theory of noncooperative games. In the first part we consider in detail for zero-sum (and constant-sum) noncooperative games under which necessary and sufficient conditions on the payoff function and different (extended) strategy sets for both players...

Single-ratio and multi-ratio fractional programs in applications are often generalized convex programs. We begin with a survey of applications of single-ratio fractional programs, min-max fractional programs and sum-of-ratios fractional programs. Given the limited advances for the latter class...