(i) For every bounded, convex (and hence decreasing function) we have oo (A.1) min j alt;pdF =alt;p(ml), feiF(a#39;ni)o oo (A.2) ... jyagt;(t)dt, where yagt; is convex and decreasing, we have x (A.3) max \ alt;pdF = 1 U(0) + a alt;p a - , (A.4) inf j alt;pdF =alt;p (mi).

Title | : | Order relations in the set of probability distribution functions and their applications in queueing theory |

Author | : | Tomasz Rolski |

Publisher | : | - 1976 |

Continue