• Sonuç bulunamadı

On Hermite-Hadamard type integral inequalities for preinvex and log-preinvex functions

N/A
N/A
Protected

Academic year: 2021

Share "On Hermite-Hadamard type integral inequalities for preinvex and log-preinvex functions"

Copied!
13
0
0

Yükleniyor.... (view fulltext now)

Tam metin

(1)

arXiv:1203.4759v1 [math.FA] 21 Mar 2012

FOR PREINVEX AND LOG-PREINVEX FUNCTIONS

MEHMET ZEKI SARIKAYA, HAKAN BOZKURT, AND NECMETTIN ALP

Abstract. In this paper, we extend some estimates of the left hand side of a Hermite- Hadamard type inequality for nonconvex functions whose derivatives absolute values are preinvex and log-preinvex.

1. Introduction

The following inequality is well-known in the literature as Hermite-Hadamard inequality: Let f : I ⊂ R → R be a convex function on an interval I of real numbers and a, b ∈ I with a < b. Then the following holds

(1.1) f a + b 2  ≤ 1 b − a b Z a f (x) dx ≤ f (a) + f (b) 2 .

Both inequalities hold in the reversed direction if the function f is concave. The inequalities (1.1) have become an important cornerstone in mathematical analysis and optimization and many uses of these inequalities have been discovered in a variety of settings. Recently, Hermite-Hadamard type inequality has been the subject of intensive research. For recent results, refinements, counterparts, generalizations and new Hadamard’s-type inequalities, see ([1], [2], [8]-[11], [16]-[21]).

In [8] some inequalities of Hermite-Hadamard type for differentiable convex map-pings connected with the left part of (1.1) were proved using the following lemma: Lemma 1. Let f : I◦⊂ R → R, be a differentiable mapping on I, a, b ∈ I(Iis

the interior of I) with a < b. If f′∈ L ([a, b]), then we have

(1.2) 1 b − a Z b a f (x)dx − f a + b 2  = (b − a) " Z 12 0 tf′(ta + (1 − t)b)dt + Z 1 1 2 (t − 1) f′(ta + (1 − t)b)dt # .

One more general result related to (1.2) was established in [9]. The main result in [8] is as follows:

2000 Mathematics Subject Classification. 26D07, 26D10, 26D99.

Key words and phrases. Hermite-Hadamard’s inequalities, non-convex functions, invex sets, H¨older’s inequality.

(2)

Theorem 1. Let f : I ⊂ R → R, be a differentiable mapping on I◦, a, b ∈ I with

a < b. If the mapping |f′| is convex on [a, b], then

(1.3) 1 b − a Z b a f (x)dx − f a + b 2  ≤ b − a 4  |f′(a)| + |f(b)| 2  .

It is well known that convexity has been playing a key role in mathematical pro-gramming, engineering, and optimization theory. The generalization of convexity is one of the most important aspects in mathematical programming and optimization theory. There have been many attempts to weaken the convexity assumptions in the literature, (see, [1], [2], [8]-[11], [16]-[21]). A significant generalization of convex functions is that of invex functions introduced by Hanson in [12]. Ben-Israel and Mond [14] introduced the concept of preinvex functions, which is a special case of invexity. Pini [15] introduced the concept of prequasiinvex functions as a gener-alization of invex functions. Noor [5]-[7] has established some Hermite-Hadamard type inequalities for preinvex and log-preinvex functions. In recent papers Barani, Ghazanfari, and Dragomir in [3] presented some estimates of the right hand side of a Hermite- Hadamard type inequality in which some preinvex functions are in-volved. His class of nonconvex functions include the classical convex functions and its various classes as special cases. For some recent results related to this nonconvex functions, see the papers ([4]-[7], [12]-[15]).

2. Preliminaries

Let f : K → R, and η(., .) : K × K → R , where K is a nonempty closed set in Rn, be continuous functions. First of all, we recall the following well known results and concepts, see [4]-[7] [13] and the references theirin

Definition 1. Let u ∈ K. Then the set K is said to be invex at u with respect to η(., .), if

u + tη(v, u) ∈ K, ∀u, v ∈ K, t ∈ [0, 1] .

K is said to be an invex set with respect to η, if K is invex at each u ∈ K. The invex set K is also called η-connected set.

Remark 1. We would like to mention that the Definition 1 of an invex set has a clear geometric interpretation. This definition essentially says that there is a path starting from a point u which is contained in K. We do not require that the point v should be one of the end points of the path. This observation plays an important role in our analysis. Note that, if we demand that v should be an end point of the path for every pair of points, u, v ∈ K, then η(v, u) = v − u and consequently invexity reduces to convexity. Thus, it is true that every convex set is also an ˙Invex set with respect to η(v, u) = v − u, but the converse is not necessarily true, see [4]-[7] and the references therein.

Definition 2. The function f on the invex set K is said to be preinvex with respect to η, if

f (u + tη(v, u)) ≤ (1 − t) f (u) + tf (v) , ∀u, v ∈ K, t ∈ [0, 1] .

The function f is said to be preconcave if and only if −f is preinvex. Note that every convex function is an preinvex function, but the converse is not true.

(3)

Definition 3. The function f on the invex set K is said to be logarithmic preinvex with respect to η, such that

f (u + tη(v, u)) ≤ (f (u))1−t(f (v))t, u, v ∈ K, t ∈ [0, 1] where f (.) > 0.

Now we define a new definition for prequasiinvex functions as follows:

Definition 4. The function f on the invex set K is said to be prequasiinvex with respect to η, if

f (u + tη(v, u)) ≤ max {f (u) , f (v)} , u, v ∈ K, t ∈ [0, 1] . From the above definitions, we have

f (u + tη(v, u)) ≤ (f (u))1−t(f (v))t ≤ (1 − t) f (u) + tf (v) ≤ max {f (u) , f (v)} .

We also need the following assumption regarding the function η which is due to Mohan and Neogy [13]:

Condition CLet K ⊆ R be an open invex subset with respect to η : K×K → R. For any x, y ∈ K and any t ∈ [0, 1] ,

η(y, y + tη(x, y)) = −tη(x, y) η(x, y + tη(x, y)) = (1 − t) η(x, y).

Note that for every x, y ∈ K and every t1, t2∈ [0, 1] from Condition C, we have

(2.1) η(y + t2η(x, y), y + t1η(x, y)) = (t2− t1) η(x, y).

In [5], Noor proved the Hermite-Hadamard inequality for the preinvex functions as follows:

Theorem 2. Let f : K = [a, a + η(b, a)] → (0, ∞) be an preinvex function on the interval of real numbers K0 (the interior of K) and a, b ∈ K0 with a < a + η(b, a).

Then the following inequality holds: (2.2) f 2a + η(b, a) 2  ≤ 1 η(b, a) a+η(b,a) Z a f (x) dx ≤ f (a) + f (a + η(b, a)) 2 ≤ f (a) + f (b) 2 .

In [3], Barani, Gahazanfari and Dragomir proved the following theorems. Theorem 3. Let A ⊆ R be an open invex subset with respect to η : A × A → R. Suppose that f : A → R is a diferentiable function.Assume p ∈ R with p > 1. If |f′|p−1p is prequasiinvex on A then, for every a, b ∈ A the following inequality holds

f (a) + f (a + η(b, a)) 2 − 1 η(a, b) Z b+η(b,a) b f (x)dx ≤ η(b, a) 2(p + 1)1p h supn|f′(a)|p−1p , |f(b)|p−1p oi p p−1

(4)

Theorem 4. Let A ⊆ R be an open invex subset with respect to η : A × A → R. Suppose that f : A → R is a diferentiable function. If |f′| is prequasiinvex on A

then, for every a, b ∈ A the following inequality holds

f (a) + f (a + η(b, a)) 2 − 1 η(a, b) Z b+η(b,a) b f (x)dx ≤ η(b, a) 4 max {|f ′(a)| , |f(b)|}

In this article, using functions whose derivatives absolute values are preinvex and log-preinvex, we obtained new inequalities releted to the left side of Hermite-Hadamard inequality for nonconvex functions.

3. Hermite-Hadamard type inequalities for preinvex functions We shall start with the following refinements of the Hermite-Hadamard inequal-ity for preinvex functions. Firstly, we give the following results connected with the left part of (2.2):

Theorem 5. Let K ⊆ R be an open invex subset with respect to η : K × K → R. Suppose that f : K → R is a diferentiable function. If |f′| is preinvex on K, then,

for every a, b ∈ K the following inequality holds:

(3.1) 1 η(b, a) Z a+η(b,a) a f (x)dx − f 2a + η(b, a) 2  ≤ η(b, a) 8 [|f ′(a)| + |f(b)|]

Proof. Suppose that a, a+ η(b, a) ∈ K. Since K is invex with respect to η, for every t ∈ [0, 1], we have a + η(b, a) ∈ K. Integrating by parts implies that

Z 12 0 tf′(a + tη(b, a))dt + Z 1 1 2 (t − 1)f′(a + tη(b, a))dt (3.2) =  tf (a + tη(b, a)) η(b, a) 12 0 + (t − 1)f (a + tη(b, a)) η(b, a) 1 1 2 − 1 η(b, a) Z 1 0 f (a + tη(b, a))dt = 1 η(b, a)f  2a + η(b, a) 2  − 1 [η(b, a)]2 Z a+η(b,a) a f (x)dx.

(5)

By preinvex function of |f′| and (3.2), we have 1 η(b, a) Z a+η(b,a) a f (x)dx − f 2a + η(b, a) 2  ≤ η(b, a) " Z 12 0 t |f′(a + tη(b, a))| dt + Z 1 1 2 (1 − t) |f′(a + tη(b, a))| dt # ≤ η(b, a) " Z 12 0 t [(1 − t) |f′(a)| + t |f(b)|] dt + Z 1 1 2 (1 − t) [(1 − t) |f′(a)| + t |f(b)|] dt # ≤ η(b, a) |f′(a)| + |f′(b)| 8  .

The proof is completed. 

Theorem 6. Let K ⊆ R be an open invex subset with respect to η : K × K → R. Suppose that f : K → R is a diferentiable function. Assume p ∈ R with p > 1. If |f′|p−1p is preinvex on K then, for every a, b ∈ K the following inequality holds

1 η(b, a) Z a+η(b,a) a f (x)dx − f 2a + η(b, a) 2  (3.3) ≤ η(b, a) 16  4 p + 1 1p  3 |f′(a)|p−1p + |f(b)|p−1p  p−1 p +|f′(a)|p−1p + 3 |f(b)|p−1p  p−1 p  .

Proof. Suppose that a, a + η(b, a) ∈ K. By assumption, H¨older’s inequality and (3.2) in the proof of Theorem 5, we have

1 η(b, a) Z a+η(b,a) a f (x)dx − f 2a + η(b, a) 2  ≤ η(b, a) " Z 12 0 t |f′(a + tη(b, a))| dt + Z 1 1 2 (1 − t) |f′(a + tη(b, a))| dt # ≤ η(b, a)   Z 12 0 tpdt !p1 Z 1 2 0 |f′(a + tη(b, a))|p−1p dt !p−1p + Z 1 1 2 (1 − t)pdt !p1 Z 1 1 2 |f′(a + tη(b, a))|p−1p dt !p−1p   ≤ η(b, a) 21+1p(p + 1) 1 p   Z 12 0 h (1 − t) |f′(a)|p−1p + t |f(b)|p−1p idt !p−1p + Z 1 1 2 h (1 − t) |f′(a)|p−1p + t |f(b)|p−1p i dt !p−1p   = η(b, a) 16  4 p + 1 1p 3 |f′(a)|p−1p + |f(b)|p−1p p−1p +|f′(a)|p−1p + 3 |f(b)|p−1p p−1p 

(6)

which completes the proof. 

Theorem 7. Under the assumptaions of Theorem 6. Then, for every a, b ∈ K the following inequality holds

1 η(b, a) Z a+η(b,a) a f (x)dx − f 2a + η(b, a) 2  (3.4) ≤ η(b, a) 16  4 p + 1 1p (3p−1p + 1) [|f′(a)| + |f′(b)|] .

Proof. We consider the inequality (3.3) i.e.

1 η(b, a) Z a+η(b,a) a f (x)dx − f 2a + η(b, a) 2  ≤ η(b, a) 16  4 p + 1 1p 3 |f′(a)|p−1p + |f(b)|p−1p p−1p +|f′(a)|p−1p + 3 |f(b)|p−1p p−1p  . Let a1 = 3 |f′(a)| p p−1, b1 = |f(b)|p−1p , a2 = |f(a)|p−1p , b2 = 3 |f(b)|p−1p . Here

0 < (p − 1) /p < 1, for p > 1. Using the fact that,

n X k=1 (ak+ bk) s ≤ n X k=1 as k+ n X k=1 bs k For (0 ≤ s < 1), a1, a2, ..., an≥ 0, b1, b2, ..., bn≥ 0, we obtain η(b, a) 16  4 p + 1 1p 3 |f′(a)|p−1p + |f(b)|p−1p  p−1 p +|f′(a)|p−1p + 3 |f(b)|p−1p  p−1 p  ≤ η(b, a) 16  4 p + 1 1p (3p−1p + 1) [|f′(a)| + |f′(b)|]

which completed proof. 

Theorem 8. Let K ⊆ R be an open invex subset with respect to η : K × K → R. Suppose that f : K → R is a diferentiable function. Assume q ∈ R with q ≥ 1. If |f′|q is preinvex on K then, for every a, b ∈ K the following inequality holds

1 η(b, a) Z a+η(b,a) a f (x)dx − f 2a + η(b, a) 2  (3.5) ≤ η(b, a) 8 "  2 |f′(a)|q+ |f(b)|q 3 1q + |f′(a)| q + 2 |f′(b)|q 3 1q# .

(7)

Proof. Suppose that a, a+ η(b, a) ∈ K. By assumption, using the well known power mean inequality and (3.2) in the proof of Theorem 5, we have

1 η(b, a) Z a+η(b,a) a f (x)dx − f 2a + η(b, a) 2  ≤ η(b, a) " Z 12 0 t |f′(a + tη(b, a))| dt + Z 1 1 2 (1 − t) |f′(a + tη(b, a))| dt # ≤ η(b, a)   Z 12 0 tdt !p1 Z 12 0 t |f′(a + tη(b, a))|qdt !1q + Z 1 1 2 (1 − t) dt !1p Z 1 1 2 (1 − t) |f′(a + tη(b, a))|qdt !1q  ≤ η(b, a) 8p1   Z 12 0 t(1 − t) |f′(a)|q+ t |f(b)|q dt !1q + Z 1 1 2 (1 − t)(1 − t) |f′(a)|q+ t |f(b)|q dt !q1  = η(b, a) 8 "  2 |f′(a)|q+ |f(b)|q 3 1q + |f′(a)| q + 2 |f′(b)|q 3 1q# ,

where 1p+1q = 1. The proof is completed. 

Theorem 9. Under the assumptions of Theorem 8. Then the following inequality holds: (3.6) 1 η(b, a) Z a+η(b,a) a f (x)dx − f 2a + η(b, a) 2  ≤η(b, a) 8 ( 21q + 1 3q1 ) [|f′(a)| + |f(b)|]

Proof. We consider the inequality (3.5), i.e.

1 η(b, a) Z a+η(b,a) a f (x)dx − f 2a + η(b, a) 2  ≤ η(b, a) 8 "  2 |f′(a)|q+ |f(b)|q 3 1q + |f′(a)| q + 2 |f′(b)|q 3 1q# .

Let a1 = 2 |f′(a)|q/3, b1 = |f′(b)|q/3, a2 = |f′(a)|q/3, b2 = 2 |f′(b)|q/3. Here

0 < 1/q < 1, for q ≥ 1. Using the fact that

n X k=1 (ak+ bk)s≤ n X k=1 as k+ n X k=1 bs k.

(8)

For (0 ≤ s < 1), a1, a2, ..., an≥ 0, b1, b2, ..., bn≥ 0, we obtain η(b, a) 8 "  2 |f′(a)|q+ |f(b)|q 3 1q + |f′(a)| q + 2 |f′(b)|q 3 1q# ≤ η(b, a) 8 ( 21q + 1 31q ) [|f′(a)| + |f(b)|] .  4. Hermite-Hadamard type inequalities for log-preinvex function

In this section, we shall continue with the following refinements of the Hermite-Hadamard inequality for log-preinvex functions and we give some results connected with the left part of (2.2):

Theorem 10. Let K ⊆ R be an open invex subset with respect to η : K × K → R. Suppose that f : K → R is a diferentiable function. If |f′| is log-preinvex on K

then, for every a, b ∈ K the following inequality holds 1 η(b, a) Z a+η(b,a) a f (x)dx − f 2a + η(b, a) 2  ≤ η(b, a) |f′(b)| 1 2 − |f(a)|12

log |f′(b)| − log |f(a)|

!2

Proof. Suppose that a, a + η(b, a) ∈ K. By assumption and (3.2) in the proof of Theorem 5, integrating by parts implies that

1 η(b, a) Z a+η(b,a) a f (x)dx − f 2a + η(b, a) 2  ≤ η(b, a) " Z 12 0 t |f′(a + tη(b, a))| dt + Z 1 1 2 (1 − t) |f′(a + tη(b, a))| dt # ≤ η(b, a) " Z 12 0 t |f′(a)|1−t|f(b)|tdt + Z 1 1 2 (1 − t) |f′(a)|1−t|f(b)|tdt # = η(b, a) " Z 12 0 |f′(a)| t |f′(b)| |f′(a)| t dt + Z 1 1 2 (1 − t) |f′(b)| |f′(b)| |f′(a)| 1−t dt # = η(b, a)   |f′(a)|

log |f′(b)| − log |f(a)|

"

− 1

log |f′(b)| − log |f(a)|

 |f′(b)| |f′(a)| t# 1 2 0 + " 1

log |f′(b)| − log |f(a)|

 |f′(b)| |f′(a)| t#1 1 2   = η(b, a) " −2 |f′(a)|12|f(b)|12

(log |f′(b)| − log |f(a)|)2 +

|f′(a)|

(log |f′(b)| − log |f(a)|)2

+ |f′(a)|

(log |f′(b)| − log |f(a)|)2

#

= η(b, a) "

|f′(b)|12 − |f(a)|12

log |f′(b)| − log |f(a)|

(9)

which completes the proof. 

Theorem 11. Let K ⊆ R be an open invex subset with respect to η : K × K → R. Suppose that f : K → R is a diferentiable function. Assume q ∈ R with q ≥ 1. If |f′|q is log-preinvex on K then, for every a, b ∈ K the following inequality holds

1 η(b, a) Z a+η(b,a) a f (x)dx − f 2a + η(b, a) 2  ≤ η(b, a)   |f′(a)|12 21p(p + 1) 1 pq1q |f′(b)|q2 − |f′(a)| q 2

log |f′(b)| − log |f(a)|

!1q .

Proof. By H¨older inequality and (3.2) in the proof of Theorem 5, we have

1 η(b, a) Z η(b,a) a f (x)dx − f 2a + η(b, a) 2  ≤ η(b, a) " Z 12 0 t |f′(a + tη(b, a))| dt + Z 1 1 2 (1 − t) |f′(a + tη(b, a))| dt # ≤ η(b, a)   Z 12 0 tpdt !p1 Z 1 2 0 |f′(a + tη(b, a))|q !1q dt + Z 1 1 2 (1 − t)p !p1 Z 1 1 2 |f′(a + tη(b, a))|qdt !1q  ≤ η(b, a)   Z 12 0 tpdt !p1 Z 12 0  |f′(a)|1−t|f(b)|tqdt !1q + Z 1 1 2 (1 − t)p !1p Z 1 1 2  |f′(a)|1−t|f(b)|tqdt !1q  = η(b, a)   |f′(a)|12 21p(p + 1) 1 pq1q |f′(b)|q2 − |f′(a)| q 2

log |f′(b)| − log |f(a)|

!1q 

where 1p+1q = 1. 

Now, we give the followig results connected with the left part of (1.1) for classical log-convex functions.

Corollary 1. Under the assumptions of Theorem 10 with η(b, a) = b − a, then the following inequality holds:

1 b − a Z b a f (x)dx − f a + b 2  ≤ (b − a) |f′(b)| 1 2 − |f′(a)| 1 2

log |f′(b)| − log |f(a)|

!2 .

(10)

Corollary 2. Under the assumptions of Theorem 11 with η(b, a) = b − a, then the following inequality holds:

1 b − a Z b a f (x)dx − f a + b 2  ≤ (b − a)   |f′(a)|12 2p1(p + 1) 1 pq1q |f′(b)|q2 − |f′(a)| q 2

log |f′(b)| − log |f(a)|

!q1 .

5. An extension to several variables functions

In this section, we shall extend the Corollary 1 and Corollary 2 to functions of several variables defined on invex subsets of Rn

Let K ⊆ Rnbe an invex set with respect to η : K × K → Rn. For every x, y ∈ K

the η-path Pxv joining the points x and v := x + η(y, x) is defined as follows

Pxv= {z : z = x + tη(y, x) : t ∈ [0, 1]} .

Proposition 1. Let K ⊆ Rn be an invex set with respect to η : K × K → Rn and

f : K → R is a functio. Suppose that η satisfies Condition C on K. Then for every x, y ∈ K the function f is log-preinvex with respect to η on η-path Pxv if and only

if the function ϕ : [0, 1] → R defined by

ϕ (t) := f (x + tη(y, x)) , is log-convex on [0, 1] .

Proof. Suppose that ϕ is log-convex on [0, 1] and z1 := x + t1η(y, x) ∈ Pxv, z2:=

x + t2η(y, x) ∈ Pxv. Fix λ ∈ [0, 1]. By (2.1), we have

f (z1+ λη(z2, z1)) = f (x + ((1 − λ) t1+ λt2) η(y, x))

= ϕ ((1 − λ) t1+ λt2)

≤ [ϕ (t1)](1−λ)[ϕ (t2)]λ

= [f (z1)](1−λ)[f (z2)]λ

Hence, f is log-preinvex with respect to η on η-path Pxv.

Conversely, let x, y ∈ K and the function f be log-preinvex with respect to η on η-path Pxv. Suppose that t1, t2∈ [0, 1]. Then, for every λ ∈ [0, 1] we have

ϕ ((1 − λ) t1+ λt2) = f (x + ((1 − λ) t1+ λt2) η(y, x))

= f (x + t1η(y, x) + λη(x + t2η(y, x), x + t1η(y, x)))

≤ [f (x + t1η(y, x))](1−λ)[f (x + t2η(y, x))]λ

= [ϕ (t1)](1−λ)[ϕ (t2)]λ

Therefore, ϕ is log-convex on [0, 1]. 

The following Teorem is a generalization of Corollary 1. Theorem 12. Let K ⊆ Rn

be an invex set with respect to η : K × K → Rn and

(11)

every x, y ∈ K the function f is log-preinvex with respect to η on η-path Pxv. Then,

for every a, b ∈ (0, 1) with a < b the following inequality holds 1 b − a Z b a Z s 0 f (x + tη(y, x)) dt  ds − Z a+b2 0 f (x + sη(y, x)) ds (5.1) ≤ (b − a) " [f (x + bη(y, x))]12 − [f (x + aη(y, x))] 1 2

log f (x + bη(y, x)) − log f (x + aη(y, x)) #2

.

Proof. Let x, y ∈ K and a, b ∈ (0, 1) with a < b. Since f is log-preinvex with respect to η on η-path Pxvby Proposition 1 the function ϕ : [0, 1] → R+defined by

ϕ (t) := f (x + tη(y, x)) ,

is log-convex on [0, 1]. Now, we define the function φ : [0, 1] → R+as follows

φ (t) := Z t 0 ϕ (s) ds = Z t 0 f (x + sη(y, x)) ds.

Obviously for every t ∈ (0, 1) we have

φ′(t) = ϕ (t) = f (x + tη(y, x)) ≥ 0

hence, φ′(t)

= φ′(t). Applying Corollary 1 to the function φ implies that 1 b − a Z b a φ (t) dt − φ a + b 2  ≤ (b − a)   φ′(b) 1 2 φ(a) 1 2 log φ′(b) − log φ′(a)   2

and we deduce that (5.1) holds. 

Remark 2. Let ϕ (t) : [0, 1] → R+be a function and q a positive real number, then

ϕ is log-convex if and only if the function ϕq(t) : [0, 1] → R+ is log-convex. ˙Indeed

for every x, y ∈ [0, 1] it is easy to see that h

[ϕ (x)]1−t[ϕ (y)]ti

q

= [ϕq(x)]1−t[ϕq(y)]t Therefore if t ∈ [0, 1] , we have

ϕ (tx + (1 − t)y) ≤ [ϕ (x)]1−t[ϕ (y)]tif and only if ϕq(tx + (1 − t)y) ≤ [ϕq(x)]1−tq(y)]t

. The following Theorem is a generalization Corollory 2 to functions several

vari-ables.

Theorem 13. Let K ⊆ Rn be an invex set with respect to η : K × K → Rn and

f : K → R+ is a function. Suppose that η satisfies condition C on K. Then for

every x, y ∈ K the function f is log-preinvex with respect to η on η-path Pxv. Then,

for every p > 1 and a, b ∈ (0, 1) with a < b the following inequality holds 1 b − a Z b a Z s 0 f (x + tη(y, x)) dt  ds − Z a+b2 0 f (x + sη(y, x)) ds (5.2) ≤ (b − a)   [f (x + aη(y, x))]12 2p1(p + 1) 1 pq 1 q [f (x + bη(y, x))]q2 − [f (x + aη(y, x))] q 2

log f (x + bη(y, x)) − log f (x + aη(y, x)) !1q  where 1 p+ 1 q = 1.

(12)

Proof. Let x, y ∈ K and a, b ∈ (0, 1) with a < b. Suppose that φ and ϕ are the functions whixh are defined in the Theorem 12. Since φ′

: [0, 1] → R+ is log-convex on [0, 1], by Remark 2 the function

φ′

q

is also is log-convex on [0, 1]. Now, by applying Corollary 2 to function φ we get

1 b − a Z b a φ(x)dx − φ a + b 2  ≤ (b − a)   φ′(a) 1 2 21p(p + 1) 1 pq 1 q φ′(b) q 2 φ(a) q 2 log φ′(b) − log φ′(a) ! 1 q 

and we deduce that (5.2) holds. The proof is complete. 

References

[1] S.S. Dragomir and R.P. Agarwal, Two inequalities for differentiable mappings and applica-tions to special means of real numbers and trapezoidal formula, Appl. Math. Lett., 11(5) (1998), 91–95.

[2] S. S. Dragomir and C. E. M. Pearce, Selected Topics on Hermite-Hadamard Inequalities and Applications, RGMIA Monographs, Victoria University, 2000.

[3] A. Barani, A.G. Ghazanfari, S.S. Dragomir, Hermite-Hadamard inequality through prequsi-invex functions, (submitted)

[4] X. M. Yang and D. Li, On properties of preinvex functions, J. Math. Anal. Appl. 256 (2001) 229-241.

[5] M. Aslam Noor, Hadamard integral inequalities for product of two preinvex function, Nonl. Anal. Forum, 14 (2009), 167-173.

[6] M. Aslam Noor, Some new classes of nonconvex functions, Nonl.Funct.Anal.Appl.,11(2006),165-171

[7] M. Aslam Noor, On Hadamard integral inequalities involving two log-preinvex functions, J. Inequal. Pure Appl. Math., 8(2007), No. 3, 1-6, Article 75.

[8] U.S. Kırmacı, Inequalities for differentiable mappings and applications to special means of real numbers and to midpoint formula, Appl. Math. Comp., 147 (2004), 137-146.

[9] U.S. Kırmacı and M.E. ¨Ozdemir, On some inequalities for differentiable mappings and ap-plications to special means of real numbers and to midpoint formula, Appl. Math. Comp., 153 (2004), 361-368.

[10] U.S. Kırmacı, Improvement and further generalization of inequalities for differentiable map-pings and applications, Computers and Math. with Appl., 55 (2008), 485-493.

[11] C.E.M. Pearce and J. Peˇcari´c, Inequalities for differentiable mappings with application to special means and quadrature formulae, Appl. Math. Lett., 13(2) (2000), 51–55.

[12] M.A. Hanson, On sufficiency of the Kuhn-Tucker conditions, J. Math. Anal. Appl. 80 (1981) 545-550.

[13] S. R. Mohan and S. K. Neogy, On invex sets and preinvex functions, J. Math. Anal. Appl. 189 (1995), 901–908.

[14] A. Ben-Israel and B. Mond, What is invexity?, J. Austral. Math. Soc., Ser. B, 28(1986), No. 1, 1-9.

[15] R. Pini, Invexity and generalized Convexity, Optimization 22 (1991) 513-525.

[16] M. Z. Sarikaya, A. Saglam and H. Yıldırım, New inequalities of Hermite-Hadamard type for functions whose second derivatives absolute values are convex and quasi-convex, International Journal of Open Problems in Computer Science and Mathematics ( IJOPCM), 5(3), 2012. [17] M. Z. Sarikaya, A. Saglam and H. Yıldırım, On some Hadamard-type inequalities for h-convex

functions, Journal of Mathematical Inequalities, Volume 2, Number 3 (2008), 335-341. [18] . M. Z. Sarikaya, M. Avci and H. Kavurmaci, On some inequalities of Hermite-Hadamard

type for convex functions, ICMS Iternational Conference on Mathematical Science. AIP Con-ference Proceedings 1309, 852 (2010).

(13)

[19] M. Z. Sarikaya and N. Aktan, On the generalization some integral inequalities and their applicationsMathematical and Computer Modelling, Volume 54, Issues 9-10, November 2011, Pages 2175-2182.

[20] M. Z. Sarikaya, E. Set and M. E. Ozdemir, On some new inequalities of Hadamard type involving h-convex functions, Acta Mathematica Universitatis Comenianae, Vol. LXXIX, 2(2010), pp. 265-272.

[21] A. Saglam, M. Z. Sarikaya and H. Yildirim, Some new inequalities of Hermite-Hadamard’s type, Kyungpook Mathematical Journal, 50(2010), 399-410.

Department of Mathematics, Faculty of Science and Arts, D¨uzce University, D¨ uzce-TURKEY

E-mail address: sarikayamz@gmail.com E-mail address: insedi@yahoo.com E-mail address: placenn@gmail.com

Referanslar

Benzer Belgeler

ECoG recordings from the experiments were analyzed using the PowerLab Chart v.7.2.1 software package (ADInstruments Pty Ltd, Castle Hill, NSW, Australia).

Analysis of variance (ANOVA) results of total color change (ΔE*) values of samples applied with acetic acid, ammonia, hydrogen peroxide and sodium silicate at different

Of the mechanical properties; experiments of compression strength parallel to grain were conducted in accordance with TS 2595 (1977), bending strength in accordance with TS

The aim of this study was to investigate the effect of the Tinuvin derivatives widely used as UV stabilizers in the plastics industry on EPDM rubber.. The EPDM rubber plates

However, the most successful results for all tested properties were determined in the styrene pretreated samples in which hygroscopicity decreased and dimensional stability

Bu romanda önermek istediğim, sizin okur katında çok güzel algıladığınız, tıpkı bu roman yazarının bunu oluştururken bir şeyle­ re şöyle bakması gibi sen bu

Bu oluşturulan serilerden her birinden 9 adet (150x150x150 mm) küp numuneler hazırlanmıştır. İkinci aşamada ise maksimum agrega çapı 4, 8, 16 mm olan beton karışımlarla

ÇalıĢmada betonun malzeme parametreleri; agrega tipi, maksimum agrega çapı, betonun basınç mukavemeti, su/çimento oranı ve malzemenin geometrik parametresi