- Research
- Open access
- Published:
On the characterization of D-preinvex functions
Journal of Inequalities and Applications volume 2012, Article number: 240 (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.
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. [1–9] 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 be a nonempty subset. Let be a nonempty pointed closed convex cone and be the dual space of Y. The dual cone of cone D is defined by
From the bipolar theorem, we have the following
Lemma 2.1 For all , if and only if .
Now we will describe some definitions of generalized convexity.
Definition 2.1 ([3])
Let the set and the vector function be given. K is said to be an invex set with respect to the function η iff
Definition 2.2 ([7])
Let be an invex set with respect to . The vector-valued function is said to be D-preinvex on K iff, , ,
Definition 2.3 ([7])
Let be an invex set with respect to . The vector-valued function is said to be D-semistrictly preinvex on K iff, such that and ,
Definition 2.4 ([7])
Let be an invex set with respect to . The function is said to be D-strictly preinvex on K iff, , , ,
In [10], Jeyakumar et al. introduced the ∗-lower semicontinuity for a vector-valued function as follows.
Definition 2.5 ([10])
The vector-valued function is ∗-lower semicontinuous if for every , 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 is ∗-upper semicontinuous if for every , 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 . We say that the function η satisfies Condition C iff, , ,
3 Properties of D-preinvex functions
In this section, we assume always that:
-
(i)
is a nonempty invex set with respect to ;
-
(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 . If is ∗-upper semicontinuous and satisfies , , then f is a D-preinvex function for the same η on K if and only if there exists an such that
Now we improve the above theorem as follows.
Theorem 3.2 Let be ∗-upper semicontinuous and satisfy , , then f is a D-preinvex function for the same η on K if and only if there exists an such that
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 is dense in the interval . Then , such that for each n and , as . Give , denote
Define, for each n,
Thus,
Since , we have
which in turn implies that , by (3.2) and K is invex with respect to η. From Condition C, we have
As , we have
By the ∗-upper semicontinuity of f on K, for every , is upper semicontinuous, it follows that for any , there exists an such that the following holds:
Hence,
Since may be arbitrarily small, then for all , we have
Since q is linear, by Lemma 2.1, we have
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 such that, for each pair , ,
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 on K. For each pair , , if there exists an such that
then f is a strictly D-preinvex function on K.
Proof By contradiction, suppose that there exist , , such that
Denote
Since f is D-preinvex, we have
We note that the pair x, z and the pair z, y are both distinct under condition (3.5). There exist such that
Denote
From Condition C,
Let , , . It is easy to verify that . Again from Condition C,
Since f is D-preinvex, we have
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 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 , . For each pair , , if there exists an such that
then f is a strictly D-preinvex function on K.
Corollary 3.2 Let f be a ∗-upper semicontinuous function on K and satisfy , . If there exists an such that, for each pair , ,
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 , . If there exists an such that, for each pair , implies
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 , there exists such that
Assume, by contradiction, that there exists such that
If , condition (3.11) implies
which contradicts (3.12). Thus, we have , and then (3.12) implies
Since D is a closed convex pointed cone, by the strong separation theorem for a convex set, it follows that there exists such that
Let , and let , then the above inequality reduces to
and
Define
From Condition C, we obtain
Since , it follows from (3.14) that
Conditions (3.11) and (3.13) give
It follows that
which together with (3.15) yields
From (3.17) and condition (3.11), we get
It follows that
which together with (3.17) yields
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.
References
Yang XM, Li D: On properties of preinvex functions. J. Math. Anal. Appl. 2001, 256: 229–241. 10.1006/jmaa.2000.7310
Yang XM, Li D: Semistrictly preinvex functions. J. Math. Anal. Appl. 2001, 258: 287–308. 10.1006/jmaa.2000.7382
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-8
Ben-Israel A, Mond B: What is invexity. J. Aust. Math. Soc. Ser. B, Appl. Math 1986, 28: 1–9. 10.1017/S0334270000005142
Antczak T: r -pre-invexity and r -invexity in mathematical programming. Comput. Math. Appl. 2005, 50: 551–566. 10.1016/j.camwa.2005.01.024
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.013
Peng JW, Zhu DL: On D -preinvex-type functions. J. Inequal. Appl. 2006., 2006: Article ID 93532
Yang XM, Yang XQ, Teo KL: Characterizations and applications of prequasi-invex functions. J. Optim. Theory Appl. 2001, 110: 645–668. 10.1023/A:1017544513305
Pini R: Invexity and generalized convexity. Optimization 1991, 22: 513–525. 10.1080/02331939108843693
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.1368
Mohan SR, Neogy SK: On invex sets and preinvex functions. J. Math. Anal. Appl. 1995, 189: 901–908. 10.1006/jmaa.1995.1057
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.
Author information
Authors and Affiliations
Corresponding author
Additional information
Competing interests
The authors declare that they have no competing interests.
Authors’ contributions
The main theorems are proved by TL. Both authors drafted the manuscript, read and approved the final manuscript.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
About this article
Cite this article
Li, T., Huang, M. On the characterization of D-preinvex functions. J Inequal Appl 2012, 240 (2012). https://doi.org/10.1186/1029-242X-2012-240
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/1029-242X-2012-240