scholarly journals Convex upper and lower bounds for present value functions

2001 ◽  
Vol 17 (2) ◽  
pp. 149-164 ◽  
Author(s):  
D. Vyncke ◽  
M. Goovaerts ◽  
J. Dhaene
Keyword(s):  
Lower Bounds ◽  
Upper And Lower Bounds ◽  
Value Functions ◽  
Present Value

A fundamental inequality for the assessment of forest land values

1987 ◽  
Vol 17 (10) ◽  
pp. 1309-1311 ◽  
Author(s):  
Karl Gustaf Löfgren
Keyword(s):  
Lower Bound ◽  
Lower Bounds ◽  
Value Function ◽  
Upper And Lower Bounds ◽  
Land Values ◽  
Land Value ◽  
Forest Land ◽  
Present Value

In this paper one well-known property and one less known property of the present value function are used to provide upper and lower bounds on the change in the value of forest land when land value is evaluated at any two different discounted price vectors. The lower bound is expressed in possibly known entities of the original harvesting program.

scholarly journals Upper and lower bounds for annuities and life insurance from incomplete mortality data

2019 ◽  
Vol 30 (80) ◽  
pp. 282-291 ◽  
Author(s):  
Filipe Costa de Souza
Keyword(s):  
Life Expectancy ◽  
Lower Bounds ◽  
Life Insurance ◽  
Survival Curve ◽  
Upper And Lower Bounds ◽  
Mortality Data ◽  
Present Value ◽  
Insurance Policies ◽  
Life Expectancy At Birth ◽  
Life Annuities

ABSTRACT This study aimed to set upper and lower bounds for the expected present value of whole life annuities and whole life insurance policies from incomplete mortality data, generalizing previous results on life expectancy. Since its inception, in the 17th century, actuarial science has been devoted to the study of annuities and insurance plans. Thus, setting intervals that provide an initial idea about the cost of these products using incomplete mortality data represents a theoretical contribution to the area and this may have major applications in markets lacking historical records or those having little reliability of mortality data, as well as in new markets still poorly explored. For both the continuous and discrete cases, upper and lower bounds were constructed for the expected present value of whole life annuities and whole life insurance policies, contracted by a person currently aged x, based on information about the expected present value of these respective financial products subscribed to by a person of age x + n and the probability that an individual of age x survives to at least age x + n. Through the bounds of a continuous annuity, in an environment where the instantaneous interest rate is equal to zero, the results shown also set bounds for the complete life expectancy, which implies that the contribution of this research generalizes previous results in the literature. It was also found that, for both annuities and insurance plans, the length of constructed intervals increases as the data gap size increases and it decreases as the survival curve becomes more rectangular. Illustratively, bounds for life expectancy at 40 and 60 years of age, for the 10 municipalities showing the highest life expectancy at birth in Brazil in 2010, were constructed by using data available in the Atlas of Human Development in Brazil.

Upper and lower bounds for convex value functions of derivative contracts

2013 ◽  
Vol 34 ◽  
pp. 69-75 ◽  
Author(s):  
Hatem Ben-Ameur ◽  
Javier de Frutos ◽  
Tarek Fakhfakh ◽  
Vacaba Diaby
Keyword(s):  
Lower Bounds ◽  
Upper And Lower Bounds ◽  
Value Functions

scholarly journals On the Generalized Distance Energy of Graphs

Mathematics ◽  
2019 ◽  
Vol 8 (1) ◽  
pp. 17 ◽  
Author(s):  
Abdollah Alhevaz ◽  
Maryam Baghipur ◽  
Hilal A. Ganie ◽  
Yilun Shang
Keyword(s):  
Lower Bounds ◽  
Complete Graph ◽  
Connected Graph ◽  
Distance Matrix ◽  
Wiener Index ◽  
Diagonal Matrix ◽  
Upper And Lower Bounds ◽  
Star Graph ◽  
Extremal Graphs ◽  
Generalized Distance

The generalized distance matrix D α ( G ) of a connected graph G is defined as D α ( G ) = α T r ( G ) + ( 1 − α ) D ( G ) , where 0 ≤ α ≤ 1 , D ( G ) is the distance matrix and T r ( G ) is the diagonal matrix of the node transmissions. In this paper, we extend the concept of energy to the generalized distance matrix and define the generalized distance energy E D α ( G ) . Some new upper and lower bounds for the generalized distance energy E D α ( G ) of G are established based on parameters including the Wiener index W ( G ) and the transmission degrees. Extremal graphs attaining these bounds are identified. It is found that the complete graph has the minimum generalized distance energy among all connected graphs, while the minimum is attained by the star graph among trees of order n.

scholarly journals Hadamard k-fractional inequalities of Fejér type for GA-s-convex mappings and applications

2019 ◽  
Vol 2019 (1) ◽  
Author(s):  
Hui Lei ◽  
Gou Hu ◽  
Zhi-Jie Cao ◽  
Ting-Song Du
Keyword(s):  
Lower Bounds ◽  
Hypergeometric Functions ◽  
Upper And Lower Bounds ◽  
Weighted Inequalities ◽  
Convex Mappings ◽  
Special Means

Abstract The main aim of this paper is to establish some Fejér-type inequalities involving hypergeometric functions in terms of GA-s-convexity. For this purpose, we construct a Hadamard k-fractional identity related to geometrically symmetric mappings. Moreover, we give the upper and lower bounds for the weighted inequalities via products of two different mappings. Some applications of the presented results to special means are also provided.

scholarly journals On the Second-Largest Reciprocal Distance Signless Laplacian Eigenvalue

Mathematics ◽  
2021 ◽  
Vol 9 (5) ◽  
pp. 512
Author(s):  
Maryam Baghipur ◽  
Modjtaba Ghorbani ◽  
Hilal A. Ganie ◽  
Yilun Shang
Keyword(s):  
Lower Bounds ◽  
Complete Graph ◽  
Distance Matrix ◽  
Upper And Lower Bounds ◽  
Laplacian Eigenvalue ◽  
Signless Laplacian ◽  
Graph Parameters ◽  
Simple Connected Graph ◽  
Second Largest Eigenvalue ◽  
Reciprocal Distance Matrix

The signless Laplacian reciprocal distance matrix for a simple connected graph G is defined as RQ(G)=diag(RH(G))+RD(G). Here, RD(G) is the Harary matrix (also called reciprocal distance matrix) while diag(RH(G)) represents the diagonal matrix of the total reciprocal distance vertices. In the present work, some upper and lower bounds for the second-largest eigenvalue of the signless Laplacian reciprocal distance matrix of graphs in terms of various graph parameters are investigated. Besides, all graphs attaining these new bounds are characterized. Additionally, it is inferred that among all connected graphs with n vertices, the complete graph Kn and the graph Kn−e obtained from Kn by deleting an edge e have the maximum second-largest signless Laplacian reciprocal distance eigenvalue.

scholarly journals Multilevel Monte Carlo methods and lower–upper bounds in initial margin computations

2020 ◽  
Vol 26 (2) ◽  
pp. 131-161
Author(s):  
Florian Bourgey ◽  
Stefano De Marco ◽  
Emmanuel Gobet ◽  
Alexandre Zhou
Keyword(s):  
Monte Carlo ◽  
Lower Bounds ◽  
Asymptotic Optimality ◽  
Upper Bounds ◽  
Upper And Lower Bounds ◽  
Independent Random Variables ◽  
Outer Function ◽  
Control Problems ◽  
Multilevel Monte Carlo ◽  
Primal Dual

AbstractThe multilevel Monte Carlo (MLMC) method developed by M. B. Giles [Multilevel Monte Carlo path simulation, Oper. Res. 56 2008, 3, 607–617] has a natural application to the evaluation of nested expectations {\mathbb{E}[g(\mathbb{E}[f(X,Y)|X])]}, where {f,g} are functions and {(X,Y)} a couple of independent random variables. Apart from the pricing of American-type derivatives, such computations arise in a large variety of risk valuations (VaR or CVaR of a portfolio, CVA), and in the assessment of margin costs for centrally cleared portfolios. In this work, we focus on the computation of initial margin. We analyze the properties of corresponding MLMC estimators, for which we provide results of asymptotic optimality; at the technical level, we have to deal with limited regularity of the outer function g (which might fail to be everywhere differentiable). Parallel to this, we investigate upper and lower bounds for nested expectations as above, in the spirit of primal-dual algorithms for stochastic control problems.

scholarly journals A Lower Bound for the Query Phase of Contraction Hierarchies and Hub Labels and a Provably Optimal Instance-Based Schema

Algorithms ◽  
2021 ◽  
Vol 14 (6) ◽  
pp. 164
Author(s):  
Tobias Rupp ◽  
Stefan Funke
Keyword(s):  
Lower Bound ◽  
Lower Bounds ◽  
Real World ◽  
Road Network ◽  
Upper And Lower Bounds ◽  
Bounded Degree ◽  
Shortest Path Routing ◽  
Graph Classes ◽  
Speed Up ◽  
To Come

We prove a Ω(n) lower bound on the query time for contraction hierarchies (CH) as well as hub labels, two popular speed-up techniques for shortest path routing. Our construction is based on a graph family not too far from subgraphs that occur in real-world road networks, in particular, it is planar and has a bounded degree. Additionally, we borrow ideas from our lower bound proof to come up with instance-based lower bounds for concrete road network instances of moderate size, reaching up to 96% of an upper bound given by a constructed CH. For a variant of our instance-based schema applied to some special graph classes, we can even show matching upper and lower bounds.

Localization of Discrete Spectrum of Multiparticle Schrödinger Operators

1985 ◽  
Vol 40 (10) ◽  
pp. 1052-1058 ◽  
Author(s):  
Heinz K. H. Siedentop
Keyword(s):  
Discrete Spectrum ◽  
Lower Bounds ◽  
Upper Bound ◽  
Schrödinger Operators ◽  
Upper And Lower Bounds ◽  
Schrodinger Operators

An upper bound on the dimension of eigenspaces of multiparticle Schrödinger operators is given. Its relation to upper and lower bounds on the eigenvalues is discussed.

Sign in / Sign up

Export Citation Format

Share Document