Open Access

On the refinements of the Hermite-Hadamard inequality

Journal of Inequalities and Applications20122012:155

https://doi.org/10.1186/1029-242X-2012-155

Received: 13 March 2012

Accepted: 21 June 2012

Published: 5 July 2012

Abstract

In this paper, we present some refinements of the classical Hermite-Hadamard integral inequality for convex functions. Further, we give the concept of n-exponential convexity and log-convexity of the functions associated with the linear functionals defined by these inequalities and prove monotonicity property of the generalized Cauchy means obtained via these functionals. Finally, we give several examples of the families of functions for which the results can be applied.

MSC: 26D15.

Keywords

Hermite-Hadamard inequality refinements n-exponential and logarithmic convexity mean value theorems

1 Introduction

One of the most well-known inequalities in mathematics for convex functions is so called Hermite-Hadamard integral inequality (see [[1], p.137])
f ( a + b 2 ) 1 b a a b f ( t ) d t f ( a ) + f ( b ) 2 ,
(1)

provided that for an interval [ a , b ] R , f : [ a , b ] R is a convex function. If the function f is concave, then (1) holds in the reverse direction. It gives an estimate from below and above of the mean value of a convex function. These inequalities for convex functions play an important role in nonlinear analysis. In recent years there have been many extensions, generalizations and similar type results of the inequalities in (1) (see [24]). These classical inequalities have been improved and generalized in many ways and applied for special means including Stolarsky-type means, logarithmic and p-logarithmic means. Also, many interesting applications of Hermite-Hadamard inequality can be found in [1].

In this paper, we present some refinements of the first Hermite-Hadamard integral inequality. Further, we study the n-exponential convexity and log-convexity of the functions associated with the linear functionals defined as differences of the left-hand and the right-hand sides of these inequalities. We also prove monotonicity property of the generalized Cauchy means obtained via these functionals. Finally, we give several examples of the families of functions for which the obtained results can be applied.

2 Main results

We shall start with the following refinement of the first Hermite-Hadamard inequality for differentiable convex functions.

Theorem 2.1 Let a , b R with a < b and f : [ a , b ] R be a differentiable convex function. Then the function
H ( x ) = 1 b a [ a x f ( t ) d t + ( b x ) f ( x ) ] f ( 2 b x x 2 a 2 2 ( b a ) )
(2)
is increasing on [ a , b ] and for all x , y [ a , b ] such that x y , we have
0 H ( x ) H ( y ) 1 b a a b f ( t ) d t f ( a + b 2 ) .
(3)
Proof We have
H ( x ) = b x b a [ f ( x ) f ( 2 b x x 2 a 2 2 ( b a ) ) ] ,
where b x b a 0 , as a < b and x [ a , b ] . If we prove that
f ( x ) f ( 2 b x x 2 a 2 2 ( b a ) ) 0 ,
(4)

then H ( x ) will be increasing on [ a , b ] .

For x a , we have x 2 b x x 2 a 2 2 ( b a ) 0 . Since f is a differentiable convex function defined on [ a , b ] , f is increasing on [ a , b ] , and so (4) holds, which in turn implies that H ( x ) 0 , showing that H ( x ) is increasing on [ a , b ] .

Now, as H ( x ) is increasing on [ a , b ] , for any x , y [ a , b ] such that a x y b , we have
H ( a ) H ( x ) H ( y ) H ( b ) .
(5)

At x = a and at x = b , (2) gives H ( a ) = 0 and H ( b ) = 1 b a a b f ( t ) d t f ( a + b 2 ) respectively. By using these values of H ( a ) and H ( b ) in (5), we have (3). □

Remark 2.2 If f is strictly convex, then H ( x ) is strictly increasing on [ a , b ) and strict inequalities hold in (3).

The second main result is another refinement of the first Hermite-Hadamard inequality for differentiable convex functions.

Theorem 2.3 Let a , b R with a < b and f : [ a , b ] R be a differentiable convex function. Then the function
H ¯ ( x ) = 1 b a [ x b f ( t ) d t + ( x a ) f ( x ) ] f ( x 2 + b 2 2 a x 2 ( b a ) )
(6)
is decreasing on [ a , b ] and for any x , y [ a , b ] such that x y , we have
0 H ¯ ( y ) H ¯ ( x ) 1 b a a b f ( t ) d t f ( a + b 2 ) .
(7)
Proof We have
H ¯ ( x ) = x a b a [ f ( x ) f ( x 2 + b 2 2 a x 2 ( b a ) ) ] ,
where x a b a 0 , as a < b and x [ a , b ] . If we prove that
f ( x ) f ( x 2 + b 2 2 a x 2 ( b a ) ) 0 ,
(8)

then H ¯ ( x ) will be decreasing on [ a , b ] .

For x b , we have x 2 + b 2 2 a x 2 ( b a ) x 0 . Since f is a differentiable convex function defined on [ a , b ] , f is increasing on [ a , b ] , and so (8) holds, which in turn implies that H ¯ ( x ) 0 , showing that H ¯ ( x ) is decreasing on [ a , b ] .

Now, as H ¯ ( x ) is decreasing on [ a , b ] , for any x , y [ a , b ] such that a x y b , we have
H ¯ ( b ) H ¯ ( y ) H ¯ ( x ) H ¯ ( a ) .
(9)

At x = a and at x = b , (6) gives H ¯ ( a ) = 1 b a a b f ( t ) d t f ( a + b 2 ) and H ¯ ( b ) = 0 respectively. By using these values of H ¯ ( a ) and H ¯ ( b ) in (9), we have (7). □

Remark 2.4 If f is strictly convex, then H ¯ ( x ) is strictly decreasing on ( a , b ] and strict inequalities hold in (7).

Let us observe the inequalities (3) and (7). Motivated by them, we define two functionals
(10)
(11)

where x , y [ a , b ] and the functions H and H ¯ are as in (2) and (6) respectively. If f is a differentiable convex function defined on [ a , b ] , then Theorems 2.1 and 2.3 imply that Φ i ( x , y ; f ) 0 , i = 1 , 2 . Now, we give mean value theorems for the functionals Φ i , i = 1 , 2 .

Theorem 2.5 Let f C 2 [ a , b ] and x , y [ a , b ] be such that x y . Let Φ 1 and Φ 2 be linear functionals defined as in (10) and (11). Then there exists ξ 1 , ξ 2 [ a , b ] such that
Φ i ( x , y ; f ) = f ( ξ i ) 2 Φ i ( x , y ; f 0 ) , i = 1 , 2 ,
(12)

where f 0 ( z ) = z 2 .

Proof Analogous to the proof of Theorem 2.4 in [5]. □

Theorem 2.6 Let f , g C 2 [ a , b ] and x , y [ a , b ] be such that x y , where g ( x ) 0 for every x [ a , b ] . Let Φ 1 and Φ 2 be linear functionals defined as in (10) and (11). If Φ 1 and Φ 2 are positive, then there exists ξ 1 , ξ 2 [ a , b ] such that
Φ i ( x , y ; f ) Φ i ( x , y ; g ) = f ( ξ i ) g ( ξ i ) , i = 1 , 2 .
(13)

Proof Analogous to the proof of Theorem 2.6 in [5]. □

Remark 2.7 If the inverse of the function f g exists, then (13) gives
ξ i = ( f g ) 1 ( Φ i ( x , y ; f ) Φ i ( x , y ; g ) ) , i = 1 , 2 .
(14)

3 n-exponential convexity and log-convexity of the Hermite-Hadamard differences

We begin this section by recollecting the definitions and properties which are going to be explored here and also some useful characterizations of these properties. Throughout the paper, I is an open interval in R .

Definition 1 A function h : I R is n-exponentially convex in the Jensen sense on I if
i , j = 1 n α i α j h ( x i + x j 2 ) 0

holds for every α i R and x i I , i = 1 , , n (see [5]).

Definition 2 A function h : I R is n-exponentially convex on I if it is n-exponentially convex in the Jensen sense and continuous on I.

Remark 3.1 From the above definition it is clear that 1-exponentially convex functions in the Jensen sense are nonnegative functions. Also, n-exponentially convex functions in the Jensen sense are k-exponentially convex functions in the Jensen sense for all k N , k n .

By definition of positive semi-definite matrices and some basic linear algebra, we have the following proposition.

Proposition 3.2 If h is n-exponentially convex in the Jensen sense, then the matrix [ h ( x i + x j 2 ) ] i , j = 1 k is a positive semi-definite matrix for all k N , k n . Particularly,
det [ h ( x i + x j 2 ) ] i , j = 1 k 0 for every k N , k n , x i I , i = 1 , , n .

Definition 3 A function h : I R is exponentially convex in the Jensen sense if it is n-exponentially convex in the Jensen sense for all n N .

Definition 4 A function h : I R is exponentially convex if it is exponentially convex in the Jensen sense and continuous.

Lemma 3.3 A function h : I ( 0 , ) is log-convex in the Jensen sense, that is, for every x , y I ,
h 2 ( x + y 2 ) h ( x ) h ( y )
holds if and only if the relation
α 2 h ( x ) + 2 α β h ( x + y 2 ) + β 2 h ( y ) 0

holds for every α , β R and x , y I .

Remark 3.4 It follows that a function is log-convex in the Jensen sense if and only if it is 2-exponentially convex in the Jensen sense. Also, by using the basic convexity theory, a function is log-convex if and only if it is 2-exponentially convex.

The following result will be useful further (see [[1], p.2]).

Lemma 3.5 If f is a convex function defined on an interval I and x 1 y 1 , x 2 y 2 , x 1 x 2 , y 1 y 2 , then the following inequality is valid
f ( x 2 ) f ( x 1 ) x 2 x 1 f ( y 2 ) f ( y 1 ) y 2 y 1 .

If the function f is concave, the inequality reverses.

Definition 5 The second order divided difference of a function f : [ a , b ] R at mutually distinct points y 0 , y 1 , y 2 [ a , b ] is defined recursively by
(15)
Remark 3.6 The value [ y 0 , y 1 , y 2 ; f ] is independent of the order of the points y 0 , y 1 and  y 2 . This definition may be extended to include the case in which some or all the points coincide (see [[1], p.16]). Namely, taking the limit y 1 y 0 in (15), we get
lim y 1 y 0 [ y 0 , y 1 , y 2 ; f ] = [ y 0 , y 0 , y 2 ; f ] = f ( y 2 ) f ( y 0 ) f ( y 0 ) ( y 2 y 0 ) ( y 2 y 0 ) 2 , y 2 y 0 ,
provided that f exists; and furthermore, taking the limits y i y 0 , i = 1 , 2 , in (15), we get
lim y 2 y 0 lim y 1 y 0 [ y 0 , y 1 , y 2 ; f ] = [ y 0 , y 0 , y 0 ; f ] = f ( y 0 ) 2 ,

provided that f exists.

The following definition of a real valued convex function is characterized by second order divided difference (see [[1], p.15]).

Definition 6 A function f : [ a , b ] R is said to be convex if and only if for all choices of three distinct points y 0 , y 1 , y 2 [ a , b ] , [ y 0 , y 1 , y 2 ; f ] 0 .

Next, we study the n-exponential convexity and log-convexity of the functions associated with the linear functionals Φ i ( i = 1 , 2 ) defined in (10) and (11).

Theorem 3.7 Let Ω = { f s : s I R } be a family of differentiable functions defined on [ a , b ] such that the function s [ y 0 , y 1 , y 2 ; f s ] is n-exponentially convex in the Jensen sense on I for every three mutually distinct points y 0 , y 1 , y 2 [ a , b ] . Let Φ i ( i = 1 , 2 ) be linear functionals defined as in (10) and (11). Then the following statements hold.

(i) The function s Φ i ( x , y ; f s ) is n-exponentially convex in the Jensen sense on I.

(ii) If the function s Φ i ( x , y ; f s ) is continuous on I, then it is n-exponentially convex on I.

Proof The idea of the proof is the same as in [5].

(i) Let α j R ( j = 1 , , n ) and consider the function
g ( y ) = j , k = 1 n α j α k f s j + s k 2 ( y ) ,
where s j I and f s j + s k 2 Ω . Then
[ y 0 , y 1 , y 2 ; g ] = j , k = 1 n α j α k [ y 0 , y 1 , y 2 ; f s j + s k 2 ]
and since [ y 0 , y 1 , y 2 ; f s j + s k 2 ] is n-exponentially convex in the Jensen sense on I by assumption, it follows that
[ y 0 , y 1 , y 2 ; g ] = j , k = 1 n α j α k [ y 0 , y 1 , y 2 ; f s j + s k 2 ] 0 .
And so by using Definition 6, we conclude that g is a convex function. Hence
Φ i ( x , y ; g ) 0 , i = 1 , 2 ,
which is equivalent to
j , k = 1 n α j α k Φ i ( x , y ; f s j + s k 2 ) 0 , i = 1 , 2 ,

and so we conclude that the function s Φ i ( x , y ; f s ) is n-exponentially convex in the Jensen sense on I.

(ii) If the function s Φ i ( x , y ; f s ) is continuous on I, then from (i) and by Definition 2 it follows that it is n-exponentially convex on I.

 □

Corollary 3.8 Let Ω = { f s : s I R } be a family of differentiable functions defined on [ a , b ] such that the function s [ y 0 , y 1 , y 2 ; f s ] is exponentially convex in the Jensen sense on I for every three mutually distinct points y 0 , y 1 , y 2 [ a , b ] . Let Φ i ( i = 1 , 2 ) be linear functionals defined as in (10) and (11). Then the following statements hold.

(i) The function s Φ i ( x , y ; f s ) is exponentially convex in the Jensen sense on I.

(ii) If the function s Φ i ( x , y ; f s ) is continuous on I, then it is exponentially convex on I.

Corollary 3.9 Let Ω = { f s : s I R } be a family of differentiable functions defined on [ a , b ] such that the function s [ y 0 , y 1 , y 2 ; f s ] is 2-exponentially convex in the Jensen sense on I for every three mutually distinct points y 0 , y 1 , y 2 [ a , b ] . Let Φ i ( i = 1 , 2 ) be linear functionals defined as in (10) and (11). Further, assume Φ i ( x , y ; f s ) ( i = 1 , 2 ) is strictly positive for f s Ω . Then the following statements hold:

(i) If the function s Φ i ( x , y ; f s ) is continuous on I, then it is 2-exponentially convex on I and so, it is log-convex.

(ii) If the function s Φ i ( x , y ; f s ) is differentiable on I, then for every s , q , u , v I such that s u and q v , we have
μ s , q ( x , y , Φ i , Ω ) μ u , v ( x , y , Φ i , Ω ) , i = 1 , 2 ,
(16)
where
μ s , q ( x , y , Φ i , Ω ) = { ( Φ i ( x , y ; f s ) Φ i ( x , y ; f q ) ) 1 s q , s q , exp ( d d s Φ i ( x , y ; f s ) Φ i ( x , y ; f s ) ) , s = q ,
(17)

for f s , f q Ω .

Proof The idea of the proof is the same as in [5].

(i) The claim is an immediate consequence of Theorem 3.7 and Remark 3.4.

(ii) Since by (i) the function s Φ i ( x , y ; f s ) is log-convex on I, that is, the function s log Φ i ( x , y ; f s ) is convex on I. Applying Lemma 3.5 with setting f ( z ) = log Φ i ( x , y ; f z ) ( i = 1 , 2 ), we get
log Φ i ( x , y ; f s ) log Φ i ( x , y ; f q ) s q log Φ i ( x , y ; f u ) log Φ i ( x , y ; f v ) u v
(18)
for s u , q v , s q , u v ; and therefore conclude that
μ s , q ( x , y , Φ i , Ω ) μ u , v ( x , y , Φ i , Ω ) , i = 1 , 2 .
If s = q , we consider the limit when q s in (18) and conclude that
μ s , s ( x , y , Φ i , Ω ) μ u , v ( x , y , Φ i , Ω ) , i = 1 , 2 .

The case u = v can be treated similarly.

 □

Remark 3.10 Note that the results from Theorem 3.7, Corollary 3.8 and Corollary 3.9 still hold when two of the points y 0 , y 1 , y 2 [ a , b ] coincide, say y 1 = y 0 , for a family of differentiable functions f s such that the function s [ y 0 , y 1 , y 2 ; f s ] is n-exponentially convex in the Jensen sense (exponentially convex in the Jensen sense, log-convex in the Jensen sense on I); and furthermore, they still hold when all three points coincide for a family of twice differentiable functions with the same property. The proofs are obtained by recalling Remark 3.6 and by using suitable characterizations of convexity.

4 Examples

In this section, we present several families of functions which fulfill the conditions of Theorem 3.7, Corollary 3.8 and Corollary 3.9 (Remark 3.10). In this way, we can construct large families of functions which are exponentially convex.

Example 4.1 Consider the family of functions
Ω 1 = { g s : R [ 0 , ) : s R }
defined by
g s ( x ) = { 1 s 2 e s x , s 0 , 1 2 x 2 , s = 0 .

We have d 2 d x 2 g s ( x ) = e s x > 0 which shows that g s is convex on R for every s R and s d 2 d x 2 g s ( x ) is exponentially convex by Example 4.1 given in [6]. From [6], we then also have that s [ y 0 , y 1 , y 2 ; g s ] is exponentially convex and so s [ y 0 , y 1 , y 2 ; g s ] is exponentially convex in Jensen sense. Now, by using Corollary 3.8, we have s Φ i ( x , y ; g s ) ( i = 1 , 2 ) are exponentially convex in Jensen sense. Since these mappings are continuous (although the mapping s g s is not continuous for s = 0 ), s Φ i ( x , y ; g s ) ( i = 1 , 2 ) are exponentially convex.

For this family of functions, by taking Ω = Ω 1 in (17), Ξ s , q ; 1 i : = μ s , q ( x , y , Φ i , Ω 1 ) ( i = 1 , 2 ) are of the form
where
x ˆ = 2 b x x 2 a 2 2 ( b a ) , y ˆ = 2 b y y 2 a 2 2 ( b a ) , x ˜ = x 2 + b 2 2 a x 2 ( b a ) , y ˜ = y 2 + b 2 2 a y 2 ( b a ) .
(19)
By using Theorem 2.6, it can be seen that
M s , q ( x , Φ i , Ω 1 ) = log μ s , q ( x , Φ i , Ω 1 ) , i = 1 , 2 ,

satisfy min { a , b } M s , q ( x , Φ i , Ω 1 ) max { a , b } , showing that M s , q ( x , Φ i , Ω 1 ) ( i = 1 , 2 ) are means.

Example 4.2 Consider the family of functions
Ω 2 = { f s : ( 0 , ) R : s R }
defined by
f s ( x ) = { x s s ( s 1 ) , s 0 , 1 , ln x , s = 0 , x ln x , s = 1 .

Here, d 2 d x 2 f s ( x ) = x s 2 = e ( s 2 ) ln x > 0 which shows that f s is convex for x > 0 and s d 2 d x 2 f s ( x ) is exponentially convex by Example 4.2 given in [6]. From [6], we have s [ y 0 , y 1 , y 2 ; f s ] is exponentially convex. Arguing as in Example 4.1, we have s Φ i ( x , y ; f s ) ( i = 1 , 2 ) are exponentially convex.

By taking Ω = Ω 2 in (17), Ξ s , q ; 2 i : = μ s , q ( x , y , Φ i , Ω 2 ) ( i = 1 , 2 ) for x , y > 0 , where x , y [ a , b ] , are of the form
where x ˆ , y ˆ , x ˜ and y ˜ are the same as in (19). If Φ i ( i = 1 , 2 ) are positive, then Theorem 2.6 applied for f = f s Ω 2 and g = f q Ω 2 yields that there exists ξ i [ a , b ] such that
ξ i s q = Φ i ( x , y ; f s ) Φ i ( x , y ; f q ) , i = 1 , 2 .
Since the functions ξ i ξ i s q ( i = 1 , 2 ) are invertible for s q , we then have
min { a , b } ( Φ i ( x , y ; f s ) Φ i ( x , y ; f q ) ) 1 s q max { a , b } , i = 1 , 2 ,
(20)

which, together with the fact that μ s , q ( x , y , Φ i , Ω 2 ) ( i = 1 , 2 ) are continuous, symmetric and monotonous (by (16)), shows that μ s , q ( x , y , Φ i , Ω 2 ) ( i = 1 , 2 ) are means.

Now, by the substitutions x x t , y y t , s s t , q q t ( t 0 , s q ), where x , y [ a , b ] , from (20) we get
min { a t , b t } ( Φ i ( x t , y t ; f s / t Φ i ( x t , y t ; f q / t ) t s q max { a t , b t } .
We define a new mean (for i = 1 , 2 ) as follows:
μ s , q ; t ( x , y , Φ i , Ω 2 ) = { ( μ s t , q t ( x t , y t , Φ i , Ω 2 ) ) 1 t , t 0 , μ s , q ( ln x , ln y , Φ i , Ω 1 ) , t = 0 .
These new means are also monotonous. More precisely, for s , q , u , v R such that s u , q v , s q , u v , we have
μ s , q ; t ( x , y , Φ i , Ω 2 ) μ u , v ; t ( x , y , Φ i , Ω 2 ) , i = 1 , 2 .
We know that
μ s t , q t ( x t , y t , Φ i , Ω 2 ) μ u t , v t ( x t , y t , Φ i , Ω 2 ) , i = 1 , 2 ,
equivalently
( Φ i ( x t , y t ; f s / t ) Φ i ( x t , y t ; f q / t ) ) t s q ( Φ i ( x t , y t ; f u / t ) Φ i ( x t , y t ; f v / t ) ) t u v , i = 1 , 2 ,

for s , q , u , v I such that s / t u / t , q / t v / t and t 0 , since μ s , q ( x , y , Φ i , Ω 2 ) ( i = 1 , 2 ) are monotonous in both parameters, the claim follows. For t = 0 , we obtain the required result by taking the limit t 0 .

Remark 4.3 If we make the substitutions x a , y b , s s 1 and t t 1 in our means μ s , q ( x , y , Φ i , Ω 2 ) and μ s , q ; t ( x , y , Φ i , Ω 2 ) ( i = 1 , 2 ), then the results for the E 1 ( r , t ) means and the generalized E 1 means given in [7] are recaptured. In this way our results for means are the generalizations of the above mentioned means.

Example 4.4 Consider the family of functions
Ω 3 = { h s : ( 0 , ) ( 0 , ) : s ( 0 , ) }
defined by
h s ( x ) = { s x ln 2 s , s 1 , x 2 2 , s = 1 .

We have d 2 d x 2 h s ( x ) = s x > 0 which shows that h s is convex for all s > 0 . Exponential convexity of s d 2 d x 2 h s ( x ) = s x on ( 0 , ) is given by Example 4.3 in [6]. Arguing as in Example 4.1, we have s Φ i ( x , y ; h s ) ( i = 1 , 2 ) are exponentially convex.

In this case by taking Ω = Ω 3 in (17), Ξ s , q ; 3 i : = μ s , q ( x , y , Φ i , Ω 3 ) ( i = 1 , 2 ) for x , y > 0 , where x , y [ a , b ] , are of the form
where x ˆ , y ˆ , x ˜ and y ˜ are the same as in (19). By using Theorem 2.6, it follows that
M s , q ( x , Φ i , Ω 3 ) = L ( s , q ) log μ s , q ( x , Φ i , Ω 3 ) , i = 1 , 2 ,

satisfy min { a , b } M s , q ( x , Φ i , Ω 3 ) max { a , b } and so M s , q ( x , Φ i , Ω 3 ) ( i = 1 , 2 ) are means, where L ( s , q ) is a logarithmic mean defined by L ( s , q ) = s q log s log q , s q , L ( s , s ) = s .

Example 4.5 Consider the family of functions
Ω 4 = { k s : ( 0 , ) ( 0 , ) : s ( 0 , ) }
defined by
k s ( x ) = e x s s .

Here, d 2 d x 2 k s ( x ) = e x s > 0 which shows that k s is convex for all s > 0 . Exponential convexity of s d 2 d x 2 k s ( x ) = e x s on ( 0 , ) is given by Example 4.4 in [6]. Arguing as in Example 4.1, we have s Φ i ( x , y ; k s ) ( i = 1 , 2 ) are exponentially convex.

In this case by taking Ω = Ω 4 in (17), Ξ s , q ; 4 i : = μ s , q ( x , y , Φ i , Ω 4 ) ( i = 1 , 2 ) for x , y > 0 , where x , y [ a , b ] , are of the form
where x ˆ , y ˆ , x ˜ and y ˜ are the same as in (19). By using Theorem 2.6, it is easy to see that
M s , q ( x , Φ i , Ω 4 ) = ( s + q ) log μ s , q ( x , Φ i , Ω 4 ) , i = 1 , 2 ,

satisfy min { a , b } M s , q ( x , Φ i , Ω 4 ) max { a , b } , showing that M s , q ( x , Φ i , Ω 4 ) ( i = 1 , 2 ) are means.

Remark 4.6 From (16), it is clear that μ s , q ( x , y , Φ i , Ω ) ( i = 1 , 2 ) for Ω = Ω 1 , Ω 2 , Ω 3  and  Ω 4 are monotonous functions in parameters s and q.

Declarations

Acknowledgements

The second author’s research was supported by the Croatian Ministry of Science, Education and Sports, under the Research Grant 117-1170889-0888.

Authors’ Affiliations

(1)
Abdus Salam School of Mathematical Sciences, GC University
(2)
Faculty of Textile Technology, University of Zagreb

References

  1. Pečarić JE, Proschan F, Tong YL: Convex Functions, Partial Orderings and Statistical Applications. Academic Press, New York; 1992.MATHGoogle Scholar
  2. Dragomir, SS, Pearce, CEM: Selected Topics on Hermite-Hadamard Inequalities and Applications. RGMIA Monographs. Victoria University (2000). . http://rgmia.vu.edu.au/monographs/ .Google Scholar
  3. Abramovich S, Farid G, Pečarić J: More about Hermite-Hadamard inequalities, Cauchy’s mean and superquadracity. J. Inequal. Appl. 2010., 2010: Article ID 102467. doi:10.1155/2010/102467Google Scholar
  4. Pečarić J, Roqia G: Generalization of Stolarsky type means. J. Inequal. Appl. 2010., 2010: Article ID 720615. doi:10.1155/2010/720615Google Scholar
  5. Pečarić, J, Perić, J: Improvements of the Giaccardi and the Petrović inequality and related Stolarsky type means. An. Univ. Craiova, Ser. Mat. Inform. (2012, to appear)Google Scholar
  6. Franjić I, Khalid S, Pečarić J: On the refinements of the Jensen-Steffensen inequality. J. Inequal. Appl. 2011., 2011: Article ID 12Google Scholar
  7. Jakšetić J, Pečarić J, Rehman AU: On Stolarsky and related means. Math. Inequal. Appl. 2010, 13(4):899–909.MathSciNetMATHGoogle Scholar

Copyright

© Khalid and Pečarić; licensee Springer 2012

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.