concave function


Also found in: Wikipedia.

concave function

[′kän‚kāv ′fəŋk·shən]
(mathematics)
A function f (x) is said to be concave over the interval a,b if for any three points x1, x2, x3 such that a <>x1<>x2<>x3<>b, f (x2)≥ L (x2), where L (x) is the equation of the straight line passing through the points [x1, f (x1)] and [x3, f (x3)].
Mentioned in ?
References in periodicals archive ?
Then [phi] is said to be a schur Harmonically concave function on [OMEGA] if and only if-[phi] is schur Harmonically convex.
0], then [phi] is a schur- Harmonically convex (Schur-Harmonically) concave function.
Let u: I [right arrow] R be a twice continuously differentiable strictly increasing concave function with decreasing absolute risk aversion defined in an open interval I.
2, that if f is an increasing convex or concave function on [a, b] , then
The optimal capacity is a concave function of [theta] as soon as the cost function is "sufficiently" convex.
Contrary to the well-known unlimited liability model represented by the objective function [Mathematical Expression Omitted], the objective function H under limited liability is not a concave function of the decision variable.
The producer chooses s to maximize the expected value of a concave function G of real profits, i.
There exists a strictly concave function |Phi~, so that the investor's utility function is now |Phi~(U(|center dot~)).
Pecaric, A continuous analogue and an extension of Rado's for convex and concave function, Bull.
Thus, similar to Doherty and Smetters (2005), we use a concave function V(.
Let |Sigma~(|center dot~) be an increasing concave function with |Sigma~(0) = 0, |Sigma~(1) = 1, |Sigma~|prime~(0) = |infinity~ and |Sigma~|prime~(1) = 0.
Therefore, this technique is not comparable with genetic algorithm, since it could be applied for only one field of problems and is not applicable for concave functions, although genetic algorithm has no limits.