This paper considers the consequences of an avoidable risk of irreversible environmental catastrophe for society’s optimal long-run consumption/pollution tradeoffs. The risk is assumed to be a nondecreasing function of pollution concentration which evolves as a dynamic environmental renewal process. The main objective of the paper is to derive qualitative insights regarding the effects of such ...

Let Ω be an open subset of R where 2 ≤ n ≤ 7; the reason for restriction on n is that our work will make use of the regularity theory for area minimizing hypersurfaces. Let s ∈ L∞(Ω), let γ : [0,∞) → [0,∞) be zero at zero, nondecreasing and convex and for f ∈ L∞(Ω) let

We consider a generalized one-dimensional bin packing model in which the cost of a bin is a nondecreasing concave function of the utilization of the bin. We show that for any given positive constant , there exists a polynomial-time approximation algorithmwith an asymptotic worst-case performance ratio of no more than 1 + .

In this paper we provide an axiomatic characterization of the idempotent discrete uninorms by means of three conditions only: conservativeness, symmetry, and nondecreasing monotonicity. We also provide an alternative characterization involving the bisymmetry property. Finally, we provide a graphical characterization of these operations in terms of their contour plots, and we mention a few open ...

We obtain inequalities of Abel type but for nondecreasing sequences rather than the usual nonincreasing sequences. Striking complex analogues are presented. The inequalities on the real domain are used to derive new integral inequalities related to those of Gauss– Pólya type.

This paper presents a new result on absolute exponential stability (AEST) of a class of continuous-time recurrent neural networks with locally Lipschitz continuous and monotone nondecreasing activation functions. The additively diagonally stable connection weight matrices are proven to be able to guarantee AEST of the neural networks. The AEST result extends and improves the existing absolute s...

Let G be a connected graph. The eccentricity of a vertex v is defined as the distance in G between v and a vertex farthest from v. The nondecreasing sequence of the eccentricities of the vertices of G is the eccentric sequence of G. In this paper, we characterize eccentric sequences of maximal outerplanar graphs.

We consider the class of nonlinear optimal control problems with all data (differential equation, state and control constraints, cost) being polynomials. We provide a simple hierarchy of LMI-relaxations whose optimal values form a nondecreasing sequence of lower bounds on the optimal value. Preliminary results show that good approximations are obtained with few moments.

The formulation of set differential equations has an intrinsic disadvantage that the diameter of the solution is nondecreasing as time increases and therefore the behavior of solutions, in some cases, do not match with the solutions of ordinary differential equations from which set differential equations can be generated. In this paper an approach is provided to remove the disadvantage.

|T ] is a nondecreasing function of T , and show how it can be efficiently estimated by a simulation study that stratifies on T. Our results are applied to static and dynamic reliability systems, the pricing of derivatives related to basket default swaps, and to round robin tournaments.