Skip to content

Advertisement

Open Access

On the characterization of D-preinvex functions

Journal of Inequalities and Applications20122012:240

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

Received: 10 April 2012

Accepted: 4 October 2012

Published: 17 October 2012

Abstract

In (J. Inequal. Appl. 2006:9532, 2006), Peng and Zhu discussed interrelations among D-preinvexity, D-semistrict preinvexity, and D-strict preinvexity for vector-valued functions. In this note, we show that the same results or even more general ones can be obtained under weaker assumptions. We also give a new characterization of D-preinvexity and D-semistrict preinvexity under mild conditions.

MSC:90C26.

Keywords

D-preinvex functionsD-semistrictly preinvex functionsD-strictly preinvex functionssemicontinuity

1 Introduction

Convexity and some generalizations of convexity play a crucial role in mathematical economics, engineering, management science, and optimization theory. Therefore, it is important to consider wider classes of generalized convex functions and also to seek practical criteria for convexity or generalized convexity (see Refs. [19] and the references therein). A significant generalization of convex functions is the introduction of preinvex functions, which is due to Ben and Mond [4]. Yang and Li [1] presented some properties of preinvex functions; in [2] they introduced two new classes of generalized convex functions called semistrictly preinvex functions and strictly preinvex functions. They established relationships between preinvex functions and semistrictly preinvex functions under a certain set of conditions. Very recently, Peng and Zhu [7] introduced the vector cases of strict preinvexity and semistrict preinvexity and established some relations between them. In this paper, we show that the same results or even a generalized version of their results can be obtained under weaker assumptions. Moreover, we give a new characterization of D-preinvexity and D-semistrict preinvexity under mild conditions. The outline of the paper is as follows. In Section 2, we give some preliminaries. The main results of the paper are presented in Section 3.

2 Preliminaries

Throughout this paper, we will use the following assumptions. Let X be a real topological vector space and Y be a real locally convex vector space, let K X be a nonempty subset. Let D Y be a nonempty pointed closed convex cone and Y be the dual space of Y. The dual cone D of cone D is defined by
D = { k Y : k , x 0 , x D } .

From the bipolar theorem, we have the following

Lemma 2.1 For all q D , q , d 0 if and only if d D .

Now we will describe some definitions of generalized convexity.

Definition 2.1 ([3])

Let the set K X and the vector function η : X × X X be given. K is said to be an invex set with respect to the function η iff
x , y K , λ [ 0 , 1 ] y + λ η ( x , y ) K .

Definition 2.2 ([7])

Let K X be an invex set with respect to η : X × X X . The vector-valued function f : K Y is said to be D-preinvex on K iff, x , y K , λ ( 0 , 1 ) ,
f ( y + λ η ( x , y ) ) λ f ( x ) + ( 1 λ ) f ( y ) D .

Definition 2.3 ([7])

Let K X be an invex set with respect to η : X × X X . The vector-valued function f : K Y is said to be D-semistrictly preinvex on K iff, x , y K such that f ( x ) f ( y ) and λ ( 0 , 1 ) ,
f ( y + λ η ( x , y ) ) λ f ( x ) + ( 1 λ ) f ( y ) int D .

Definition 2.4 ([7])

Let K X be an invex set with respect to η : X × X X . The function f : K Y is said to be D-strictly preinvex on K iff, x , y K , x y , λ ( 0 , 1 ) ,
f ( y + λ η ( x , y ) ) λ f ( x ) + ( 1 λ ) f ( y ) int D .

In [10], Jeyakumar et al. introduced the -lower semicontinuity for a vector-valued function as follows.

Definition 2.5 ([10])

The vector-valued function f : K Y is -lower semicontinuous if for every q D , q ( f ) ( ) = q , f ( ) is lower semicontinuous on K.

In [7], Peng et al. introduced the -upper semicontinuity for a vector-valued function as follows.

Definition 2.6 ([7])

The vector-valued function f : K Y is -upper semicontinuous if for every q D , q ( f ) ( ) = q , f ( ) is upper semicontinuous on K.

In order to prove our main result, we need Condition C introduced by Mohan and Neogy [11] as follows.

Condition C Let η : X × X X . We say that the function η satisfies Condition C iff, x , y K , λ [ 0 , 1 ] ,

3 Properties of D-preinvex functions

In this section, we assume always that:
  1. (i)

    K X is a nonempty invex set with respect to η : X × X X ;

     
  2. (ii)

    η satisfies Condition C; f is a vector-valued function on K.

     

The following result was proved in Ref. [7]; see Theorem 2.2 in Ref. [7].

Theorem 3.1 Let K be a nonempty open invex set in X with respect to η : X × X X . If f : K Y is -upper semicontinuous and satisfies f ( y + η ( x , y ) ) f ( x ) D , x , y K , then f is a D-preinvex function for the same η on K if and only if there exists an α ( 0 , 1 ) such that
f ( y + α η ( x , y ) ) α f ( x ) + ( 1 α ) f ( y ) D , x , y K .

Now we improve the above theorem as follows.

Theorem 3.2 Let f : K Y be -upper semicontinuous and satisfy f ( y + η ( x , y ) ) f ( x ) D , x , y K , then f is a D-preinvex function for the same η on K if and only if there exists an α ( 0 , 1 ) such that
f ( y + α η ( x , y ) ) α f ( x ) + ( 1 α ) f ( y ) D , x , y K .
(3.1)
Proof The necessity follows directly from the definition of D-preinvexity for the vector-valued function f. We only need to prove the sufficiency. By Lemma 2.1 in Ref. [7], the set A = { α [ 0 , 1 ] f ( y + α η ( x , y ) ) α f ( x ) + ( 1 α ) f ( y ) D , x , y K } is dense in the interval [ 0 , 1 ] . Then α ¯ ( 0 , 1 ) , { α n } ( 0 , 1 ) A such that α n < α ¯ for each n and α n α ¯ , as n . Give x , y K , denote
z = y + α ¯ η ( x , y ) .
Define, for each n,
y n = y + α ¯ α n 1 α n η ( x , y ) .
(3.2)
Thus,
y n y , n .
Since 0 < α n < α ¯ < 1 , we have
0 < α ¯ α n 1 α n < 1 ,
which in turn implies that y n K , by (3.2) and K is invex with respect to η. From Condition C, we have
y n + α n η ( x , y n ) = y + α ¯ α n 1 α n η ( x , y ) + α n η ( x , y + α ¯ α n 1 α n η ( x , y ) ) = y + α ¯ α n 1 α n η ( x , y ) + α n ( 1 α ¯ α n 1 α n ) η ( x , y ) = y + α ¯ η ( x , y ) = z .
As α n A , we have
f ( z ) = f ( y + α ¯ η ( x , y ) ) = f ( y n + α n η ( x , y n ) ) α n f ( x ) + ( 1 α n ) f ( y n ) D .
By the -upper semicontinuity of f on K, for every q D , q ( f ) ( ) is upper semicontinuous, it follows that for any ϵ > 0 , there exists an N > 0 such that the following holds:
q ( f ) ( y n ) q ( f ) ( y ) + ϵ , n > N .
(3.3)
Hence,
q ( f ) ( z ) α n q ( f ) ( x ) + ( 1 α n ) q ( f ) ( y n ) α n q ( f ) ( x ) + ( 1 α n ) ( q ( f ) ( y ) + ϵ ) α ¯ q ( f ) ( x ) + ( 1 α ¯ ) ( q ( f ) ( y ) + ϵ ) ( n ) .
Since ϵ > 0 may be arbitrarily small, then for all q D , we have
q ( f ) ( z ) α ¯ q ( f ) ( x ) + ( 1 α ¯ ) q ( f ) ( y ) .
Since q is linear, by Lemma 2.1, we have
f ( z ) α ¯ f ( x ) + ( 1 α ¯ ) f ( y ) D .

Hence, f is a D-preinvex function for the same η on K, this completes the proof. □

Remark 3.1 We see from Theorem 3.2 that the condition of openness in Theorem 3.1 can be deleted in order to obtain the same results.

Now, we state another result in Ref. [7]; see Theorem 3.3 in Ref. [7].

Theorem 3.3 Let f be a D-preinvex function on K. If there exists an α ( 0 , 1 ) such that, for each pair x , y K , x y ,
f ( y + α η ( x , y ) ) α f ( x ) + ( 1 α ) f ( y ) int D , x , y K ,
(3.4)

then f is a D-strictly preinvex function on K.

The above theorem can be improved as follows.

Theorem 3.4 Let f be a D-preinvex function with respect to η : X × X X on K. For each pair x , y K , x y , if there exists an α ( 0 , 1 ) such that
f ( y + α η ( x , y ) ) α f ( x ) + ( 1 α ) f ( y ) int D , x , y K ,
(3.5)

then f is a strictly D-preinvex function on K.

Proof By contradiction, suppose that there exist x , y K , x y , λ ( 0 , 1 ) such that
λ f ( x ) + ( 1 λ ) f ( y ) f ( y + λ η ( x , y ) ) int D .
(3.6)
Denote
z = y + λ η ( x , y ) .
Since f is D-preinvex, we have
λ f ( x ) + ( 1 λ ) f ( y ) f ( y + λ η ( x , y ) ) D .
(3.7)
We note that the pair x, z and the pair z, y are both distinct under condition (3.5). There exist β 1 , β 2 ( 0 , 1 ) such that
(3.8)
(3.9)
Denote
x ¯ = z + β 1 η ( x , z ) , y ¯ = y + β 2 η ( z , y ) .
From Condition C,
Let μ 1 = λ + ( 1 λ ) β 1 , μ 2 = λ β 2 , μ = λ μ 2 μ 1 μ 2 . It is easy to verify that μ 1 , μ 2 , μ ( 0 , 1 ) . Again from Condition C,
y ¯ + μ η ( x ¯ , y ¯ ) = y + μ 2 η ( x , y ) + μ η ( y + μ 1 η ( x , y ) , y + μ 2 η ( x , y ) ) = y + μ 2 η ( x , y ) + μ η ( y + μ 1 η ( x , y ) , y + μ 1 η ( x , y ) + ( μ 2 μ 1 ) η ( x , y ) ) = y + μ 2 η ( x , y ) + μ η ( y + μ 1 η ( x , y ) , y + μ 1 η ( x , y ) + ( μ 2 μ 1 1 μ 1 ) η ( x , y + μ 1 η ( x , y ) ) ) = y + μ 2 η ( x , y ) ( μ ( μ 2 μ 1 ) 1 μ 1 ) η ( x , y + μ 1 η ( x , y ) ) = y + μ 2 η ( x , y ) μ ( μ 2 μ 1 ) η ( x , y ) = y + ( μ 2 μ ( μ 2 μ 1 ) ) η ( x , y ) = y + λ η ( x , y ) = z .
Since f is D-preinvex, we have
μ f ( x ¯ ) + ( 1 μ ) f ( y ¯ ) f ( z ) D .
(3.10)
Thus, from (3.7)-(3.10), we have
Where

which contradicts (3.6). This completes the proof. □

Remark 3.2 In Theorem 3.3, a uniform α ( 0 , 1 ) is needed, while in Theorem 3.4 this condition has been weakened to great extent.

By Theorem 2.3 in Ref. [7] and Theorem 3.4 above, we have the following corollary.

Corollary 3.1 Let f be a -lower semicontinuous function on K and satisfy f ( y + η ( x , y ) ) f ( x ) D , x , y K . For each pair x , y K , x y , if there exists an α ( 0 , 1 ) such that
f ( y + α η ( x , y ) ) α f ( x ) + ( 1 α ) f ( y ) int D , x , y K ,

then f is a strictly D-preinvex function on K.

Corollary 3.2 Let f be a -upper semicontinuous function on K and satisfy f ( y + η ( x , y ) ) f ( x ) D , x , y K . If there exists an α ( 0 , 1 ) such that, for each pair x , y K , x y ,
f ( y + α η ( x , y ) ) α f ( x ) + ( 1 α ) f ( y ) int D , x , y K ,

then f is a strictly D-preinvex function on K.

Proof This result is obtained by Theorems 3.2 and 3.4 above. □

Theorem 3.5 Let f be a -lower semicontinuous function on K and satisfy f ( y + η ( x , y ) ) f ( x ) D , x , y K . If there exists an α ( 0 , 1 ) such that, for each pair x , y K , f ( x ) f ( y ) implies
f ( y + α η ( x , y ) ) α f ( x ) + ( 1 α ) f ( y ) int D , x , y K ,
(3.11)

then f is both a D-preinvex function on K and a D-semistrictly preinvex function on K.

Proof First, we prove that f is a D-preinvex function on K. By Theorem 2.3 in Ref. [7], we need to show that for each x , y K , there exists λ ( 0 , 1 ) such that
f ( y + λ η ( x , y ) ) λ f ( x ) + ( 1 λ ) f ( y ) D .
Assume, by contradiction, that there exists x , y K such that
f ( y + λ η ( x , y ) ) λ f ( x ) + ( 1 λ ) f ( y ) D , λ ( 0 , 1 ) .
(3.12)
If f ( x ) f ( y ) , condition (3.11) implies
f ( y + α η ( x , y ) ) α f ( x ) + ( 1 α ) f ( y ) int D α f ( x ) + ( 1 α ) f ( y ) D ,
which contradicts (3.12). Thus, we have f ( x ) = f ( y ) , and then (3.12) implies
f ( y + λ η ( x , y ) ) f ( x ) D = f ( y ) D , λ ( 0 , 1 ) .
(3.13)
Since D is a closed convex pointed cone, by the strong separation theorem for a convex set, it follows that there exists k D { 0 } such that
(3.14)
Let λ = α 1 α 2 ( 0 , 1 ) , and let z = y + λ η ( x , y ) , then the above inequality reduces to
k , f ( x ) f ( z ) < 0 ,
(3.15)
and
k , f ( y ) f ( z ) < 0 .
(3.16)
Define
z 1 = z + α η ( x , z ) , z 2 = z 1 + α η ( y , z 1 ) .
From Condition C, we obtain
Since 1 2 α ( 0 , 1 ) , it follows from (3.14) that
k , f ( y ) f ( z 1 ) < 0 .
(3.17)
Conditions (3.11) and (3.13) give
f ( z 1 ) = f ( z + α η ( x , z ) ) α f ( x ) + ( 1 α ) f ( y ) int D .
It follows that
k , α f ( x ) + ( 1 α ) f ( z ) f ( z 1 ) > 0 ,
which together with (3.15) yields
k , f ( z ) f ( z 1 ) > 0 .
(3.18)
From (3.17) and condition (3.11), we get
f ( z 2 ) = f ( z 1 + α η ( y , z 1 ) ) α f ( y ) + ( 1 α ) f ( z 1 ) int D .
It follows that
k , α f ( y ) + ( 1 α ) f ( z 1 ) f ( z 2 ) > 0 ,
which together with (3.17) yields
k , f ( z 1 ) f ( z 2 ) = k , f ( z 1 ) f ( z ) > 0 ,

which contradicts (3.18), hence f is a D-preinvex function on K. Next, the D-semistrict preinvexity of f on K follows from Theorem 3.9 of Ref. [7]. □

4 Conclusions

In this paper, we firstly obtain a property of D-preinvex functions. We then get a sufficient condition of the strictly D-preinvex functions in terms of intermediate-point D-preinvex functions. We finally obtain a sufficient condition of D-preinvex functions and D-semistrictly preinvex functions. Our results improve and extend the existing ones in the literature.

Declarations

Acknowledgements

The research of the authors is partially supported by the Foundation of Department of Education of Zhejiang Province under Grant Y201121204 and by the Natural Science Foundation of Zhejiang Province (Y7100544). The authors would like to express their thanks to the referees for helpful suggestions.

Authors’ Affiliations

(1)
Tianmu College, Zhejiang A & F University, Hangzhou, China
(2)
School of Economy and Management, Zhejiang A & F University, Hangzhou, China

References

  1. Yang XM, Li D: On properties of preinvex functions. J. Math. Anal. Appl. 2001, 256: 229–241. 10.1006/jmaa.2000.7310MathSciNetView ArticleGoogle Scholar
  2. Yang XM, Li D: Semistrictly preinvex functions. J. Math. Anal. Appl. 2001, 258: 287–308. 10.1006/jmaa.2000.7382MathSciNetView ArticleGoogle Scholar
  3. Weir T, Mond B: Pre-invex functions in multiple objective optimization. J. Math. Anal. Appl. 1988, 136: 29–38. 10.1016/0022-247X(88)90113-8MathSciNetView ArticleGoogle Scholar
  4. Ben-Israel A, Mond B: What is invexity. J. Aust. Math. Soc. Ser. B, Appl. Math 1986, 28: 1–9. 10.1017/S0334270000005142MathSciNetView ArticleGoogle Scholar
  5. Antczak T: r -pre-invexity and r -invexity in mathematical programming. Comput. Math. Appl. 2005, 50: 551–566. 10.1016/j.camwa.2005.01.024MathSciNetView ArticleGoogle Scholar
  6. Antczak T: New optimality conditions and duality results of G -type in differentiable mathematical programming. Nonlinear Anal. 2007, 66: 1617–1632. 10.1016/j.na.2006.02.013MathSciNetView ArticleGoogle Scholar
  7. Peng JW, Zhu DL: On D -preinvex-type functions. J. Inequal. Appl. 2006., 2006: Article ID 93532Google Scholar
  8. Yang XM, Yang XQ, Teo KL: Characterizations and applications of prequasi-invex functions. J. Optim. Theory Appl. 2001, 110: 645–668. 10.1023/A:1017544513305MathSciNetView ArticleGoogle Scholar
  9. Pini R: Invexity and generalized convexity. Optimization 1991, 22: 513–525. 10.1080/02331939108843693MathSciNetView ArticleGoogle Scholar
  10. Jeyakumar V, Oettli W, Natividad M: A solvability theorem for a class of quasiconvex mappings with applications to optimization. J. Math. Anal. Appl. 1993, 179(2):537–546. 10.1006/jmaa.1993.1368MathSciNetView ArticleGoogle Scholar
  11. Mohan SR, Neogy SK: On invex sets and preinvex functions. J. Math. Anal. Appl. 1995, 189: 901–908. 10.1006/jmaa.1995.1057MathSciNetView ArticleGoogle Scholar

Copyright

© Li and Huang; 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.

Advertisement