Abstract

A kind of generalized convex set, called as local star-shaped ??-invex set with respect to ??, is presented, and some of its important characterizations are derived. Based on this concept, a new class of functions, named as semilocal ??-preinvex functions, which is a generalization of semi-??-preinvex functions and semilocal ??-convex functions, is introduced. Simultaneously, some of its basic properties are discussed. Furthermore, as its applications, some optimality conditions and duality results are established for a nonlinear programming.

1. Introduction

It is well known that convexity and generalized convexity have been playing a key role in many aspects of optimization, such as duality theorems, optimality conditions, and convergence of optimization algorithms. Therefore, the research on characterizations and generalizations of convexity is one of the most important aspects in mathematical programming and optimization theory in [1, 2]. During the past several decades, many significant generalizations of convexity have been proposed.

In 1977, Ewing [3] presented a generalized convexity known as semilocal convexity, where the concept is applied to provide sufficient optimality conditions in variational and control problems. Generalizations of semilocal convex functions and their properties have been studied by Kaul and Kaur [4, 5] and Kaur [6]. In [7], optimality conditions and duality results were established for nonlinear programming involving semilocal preinvex and related functions. These results are extended in [8] for a multiple-objective programming problems. In [9, 10], Lyall et al. investigated the optimality conditions and duality results for fractional single- (multiple-) objective programming involving semilocal preinvex and related functions, respectively.

On the other hand, in 1999, Youness [11] introduced the concepts of ??-convex sets, ??-convex functions, and ??-convex programming, discussed some of their basic properties, and obtained some optimality results on ??-convex programming. In 2002, Chen [12] brought forward a class of semi-??-convex functions and also discussed its basic properties. In 2007, by combining the concept of semi-??-convexity and that of semilocal convexity, Hu et al. [13] put forward the concept of generalized convexity called as semilocal ??-convexity, studied some of its characterizations, and obtained some optimality conditions and duality results for semilocal ??-convex programming. In [14], optimality and duality were further studied for a fractional multiple-objective programming involving semilocal ??-convexity. In 2009, Fulga and Preda [15] extended the ??-convexity to ??-preinvexity and local ??-preinvexity and discussed some of their properties and an application. In 2011, Luo and Jian [16] introduced semi-??-preinvex maps in Banach spaces and studied some of their properties.

Motivated by research work of [1316] and references therein, in this paper, we present the concept of semilocal ??-preinvexity and discuss its some important properties. Furthermore, as applications of semilocal ??-preinvexity, we establish the optimality conditions and duality results for a nonlinear programming. The concept of semilocal ??-preinvexity unifies the concepts of semilocal ??-convexity and semi-??-preinvexity. Thus, we extend the work of [10, 12, 13] and generalize the results obtained in the literatures on this topic.

2. Preliminaries

Throughout the paper, let ???? denote the ??-dimensional Euclidean space, and let ??:????????? and ??:????×????????? be two fixed mappings. In this section, we review some related definitions and some results which will be used in this paper.

Definition 2.1 (see [11]). A set ??????? is said to be ??-convex if there is a map ?? such that ????(??)+(1-??)??(??)???,???,?????,0=??=1.(2.1)

Definition 2.2 (see [11]). A function ??:??????? is said to be ??-convex on a set ??????? if there is a map ?? such that ?? is an ??-convex set and ??(????(??)+(1-??)??(??))=????(??(??))+(1-??)??(??(??)),???,?????,0=??=1.(2.2)

Definition 2.3 (see [12]). A function ??:??????? is said to be semi-??-convex on a set ??????? if there is a map ?? such that ?? is an ??-convex set and ??(????(??)+(1-??)??(??))=????(??)+(1-??)??(??),???,?????,0=??=1.(2.3)

Definition 2.4 (see [15]). A set ??????? is said to be ??-invex with respect to ?? if ??(??)+????(??(??),??(??))???,???,?????,0=??=1.(2.4)

Definition 2.5 (see [15]). Let ??????? be an ??-invex set with respect to ??. A function ??:??????? is said to be ??-preinvex on ?? with respect to ?? if ??(??(??)+????(??(??),??(??)))=????(??(??))+(1-??)??(??(??)),???,?????,0=??=1.(2.5)

Definition 2.6 (see [16]). Let ??????? be an ??-invex set with respect to ??. A function ??:??????? is said to be semi-??-preinvex on ?? with respect to ?? if ??(??(??)+????(??(??),??(??)))=????(??)+(1-??)??(??),???,?????,0=??=1.(2.6)

Definition 2.7 (see [17]). A set ??????? is said to be local star-shaped invex with respect to ?? if for any ??,?????, there is a maximal positive number ??(??,??)=1 satisfying [].??+????(??,??)???,????0,??(??,??)(2.7)

Definition 2.8 (see [13]). A set ??????? is said to be local star-shaped ??-convex if there is a map ?? such that corresponding to each pair of points ??,?????, and there is a maximal positive number ??(??,??)=1 satisfying [].????(??)+(1-??)??(??)???,????0,??(??,??)(2.8)

Definition 2.9 (see [13]). A function ??:??????? is said to be semilocal ??-convex on a local star-shaped ??-convex set ??????? if for each pair of ??,?????(with a maximal positive number ??(??,??)=1 satisfying (2.8)), there exists a positive number ??(??,??)=??(??,??) satisfying [].??(??(??(??))+(1-??)??(??))=????(??)+(1-??)??(??),????0,??(??,??)(2.9)

Definition 2.10 (see [18]). A vector function ??:??0????? is said to be a convex-like function if for any ??,?????0????? and 0=??=1, there is ?????0 such that ??(??)=????(??)+(1-??)??(??),(2.10) where the inequalities are taken component wise.

Lemma 2.11 (see [19]). Let ?? be a nonempty set in ????, and let ??:??????? be a convexlike function then either ??(??)<0 has a solution ????? or ??????(??)=0 for all ????? and some ???????, ??=0, and ???0, but both alternatives are never true.

3. Local Star-Shaped ??-Invex Set

In this section, we introduce the local star-shaped ??-invex set with respect to a given mapping ?? and discuss some of its basic characterizations.

Definition 3.1. A set ??????? is said to be local star-shaped ??-invex with respect to a given mapping ?? if there is a map ?? such that corresponding to each pair of points ??,?????, and there is a maximal positive number ??(??,??)=1 satisfying ??(??)+????(??(??),??(??))???,0=??=??(??,??).(3.1)

Remark 3.2. Every ??-convex set is a local star-shaped ??-invex set with respect to ??, where ??(??,??)=??-??,??(??,??)=1, for all ??,???????. Every local star-shaped ??-convex set is a local star-shaped ??-invex set with respect to ??, where ??(??,??)=??-??, for all ??,???????. Every ??-invex set with respect to ?? is a local star-shaped ??-invex set with respect to ??, where ??(??,??)=1, for all ??,???????. But their converses are not necessarily true.

The following example shows that local star-shaped ??-invex set is more general than ??-convex set, ??-invex set, and local star-shaped ??-convex set.

Example 3.3. Let ???=[-4,-1)[1,4], ?????(??)=2if|??|=2,-1if???????|??|>2,(??,??)=??-??if??=0,??=0,or??=0,??=0,-1-??if??>0,??=0,or??=0,??<0,1-??if??<0,??=0,or??=0,??>0.(3.2)
We can testify that ?? is a local star-shaped ??-invex set with respect to ??.
However, when ??0=1, ??0=3, there exists a ??1?[0,1] such that????1??(??0)+(1-??1)??(??0)=-1+2??1???, namely, ?? is not an ??-convex set.
Also, there is a ??2?[0,1] such that ??(??0)+??2??(??(??0),??(??0))=-1???, that is, ?? is not an ??-invex set with respect to ??.
Similarly, for any positive number ??=1, there exists a sufficiently small positive number ??3=?? satisfying ??3??(??0)+(1-??3)??(??0)=-1+2??3???, that is, ?? is not a local star-shaped ??-convex set.

Proposition 3.4. If a set ??????? is local star-shaped ??-invex with respect to ??, then ??(??)???.

Proof. Since ?? is local star-shaped ??-invex, then for any ??,?????, there exists a maximal positive number ??(??,??)=1 satisfying ??(??)+????(??(??),??(??))???, for all ???[0,??(??,??)].
Thus, for ??=0, ??(??)???.
Hence, ??(??)???.

Proposition 3.5. Let ??(??) be local star-shaped invex with respect to ??, ??(??)???, then ?? is local star-shaped ??-invex with respect to the same ??.

Proof. Assume that ??,?????, then ??(??),??(??)???(??). Since ??(??) is local star-shaped invex with respect to ??, thus for ??(??),??(??)???(??), there exists a positive number ??(??(??),??(??))=1 satisfying [].??(??)+????(??(??),??(??))???(??)???,????0,??(??(??),??(??))(3.3) Hence, ?? is local star-shaped ??-invex with respect to ??.

Remark 3.6. Every local star-shaped invex set with respect to ?? is local star-shaped ??-invex set, where ?? is an identity map, but its converse is not necessarily true. See the following example.

Example 3.7. Let ??1={(??,??)???2:(??,??)=??1(0,0)+??2(2,3)+??3(0,2)}, ??2={(??,??)???2:(??,??)=??1(0,0)+??2(-2,-3)+??3(0,-4)}, and ??=??1???2, where ??1,??2,??3=0 and ?3??=1????=1. Let ??:??2×??2???2 be defined as ??(??,??)=??-??, and let ??:??2???2 be defined as ???????(??,??)=(0,3)if(??,??)=(2,3),(0,??-1),if(??,??)???1?{(0,0),(2,3)},(0,??)if(??,??)???2.(3.4)
It is not difficult to prove that ?? is a local star-shaped ??-invex set with respect to ??. However, by taking ??=(2,3), ??=(0,-4), we know that there exists no maximal positive number ??(??,??)=1 such that ??+????(??,??)???, for all ???[0,??(??,??)].
That is, ?? is not a local star-shaped invex set with respect to ??.

Proposition 3.8. Let ?????????(??=1,2,,??) be a collection of local star-shaped ??-invex sets with the same map ??, then ?????=1???? is a local star-shaped ??-invex set with respect to ??.

Proof. For all???,???????=1????, we have ??,???????(??=1,2,,??).
Since ????(??=1,2,,??) are all local star-shaped ??-invex sets, then there exist positive numbers ????(??,??)=1(??=1,2,,??) such that ??(??)+????(??(??),??(??))??????,????0,?????(??,??),??=1,2,,??.(3.5) Taking ??(??,??)=min????(??,??), ??=1,2,,??, we can get ??(??)+????(??(??),??(??))??????=1????[].,????0,??(??,??)(3.6) Therefore, the proposition is proved.

Remark 3.9. Even if ??1, ??2 are all local star-shaped ??-invex set with respect to ??, ??1???2 is not necessarily a local star-shaped ??-invex set. See the following example.

Example 3.10. Let the map ??:??2×??2???2 be defined as ??(??,??)=??-??, and the map ??:??2???2 be defined as ??(??,??)=(??/2,??/2). Consider the two sets ??1=?(??,??)???2:(??,??)=??1(0,0)+??2(2,0)+??3?,??(0,2)2=?(??,??)???2:(??,??)=??1(0,0)+??2(-2,0)+??3?,(0,-2)(3.7) where ????=0, ??=1,2,3, and ?3??=1????=1.
We can easily prove that the two sets ??1, ??2 are all local star-shaped ??-invex sets with respect to ??. However, when ??=(2,0), ??=(0,-2), there is not a positive number ??(??,??)=1 such that ??(??)+??(??(??),??(??))=(??,-1+??)???1???2].,????(0,??(??,??)(3.8) Thus, ??1???2 is not a local star-shaped ??-invex set with respect to ??.

Proposition 3.11. Let ??????? be a local star-shaped ??1 and ??2-invex set with respect to the same ??, then ?? is a local star-shaped (??1°??2) and (??2°??1)-invex set with respect to the same ??.

Proof. By contradiction, assume that for a pair of ??,?????, for all ??(??,??)?(0,1], there exists a ??0?(0,??(??,??)] such that ??1°??2(??)+??0??((??1°??2(??),??1°??2(??))???, that is, ??1(??2??)+??0??((??1(??2??),??1(??2??))???.
Since, from Proposition 3.4, ??2(??),??2(??)???, then ??1(??2??)+??0??(??1(??2??),??1(??2??))??? contradicts the local star-shaped ??1-invexity of ??.
Hence, ?? is a local star-shaped (??1°??2)-invex set.
Similarly, ?? is a local star-shaped (??2°??1)-invex set.

4. Semilocal ??-Preinvex Functions

In the section, we present the concept of semilocal ??-preinvex function and study some of its properties. We first recall a relevant definition.

Definition 4.1 (see [15]). A function ??:??????? is said to be local ??-preinvex on ??????? with respect to ?? if for any ??,????? (with a maximal positive number ??(??,??)=1 satisfying (3.1)), there exists 0<??(??,??)=??(??,??) such that ?? is a local star-shaped ??-invex set and [].??(??(??)+????(??(??),??(??)))=????(??(??))+(1-??)??(??(??)),????0,??(??,??)(4.1)

Definition 4.2. A function ??:??????? is said to be semilocal ??-preinvex on ??????? with respect to ?? if for any ??,????? (with a maximal positive number ??(??,??)=1 satisfying (3.1)), there exists 0<??(??,??)=??(??,??) such that ?? is a local star-shaped ??-invex set and [].??(??(??)+????(??(??),??(??)))=????(??)+(1-??)??(??),????0,??(??,??)(4.2)
If the inequality sign above is strict for any ??,????? and ?????, then ?? is called a strict semilocal ??-preinvex function.
A vector function ??:????????? is said to be semilocal ??-preinvex on a local star-shaped ??-invex set ??????? with respect to ?? if for each pair of points ??,?????(with a maximal positive number ??(??,??)=1 satisfying (3.1)), there exists a positive number ??(??,??)=??(??,??) satisfying [],??(??(??)+????(??(??),??(??)))=????(??)+(1-??)??(??),????0,??(??,??)(4.3) where the inequalities are taken component wise.
The definition of strict semilocal ??-preinvex of a vector function ??:????????? is similar to the one for a vector semilocal ??-preinvex function.

Remark 4.3. Every semilocal ??-convex function on a local star-shaped set ?? is a semilocal ??-preinvex function, where ??(??,??)=??-??, for all ??,???????. Every semi-??-preinvex function with respect to ?? is a semilocal ??-preinvex function, where ??(??,??)=??(??,??)=1, for all ??,???????. But their converses are not necessarily true.

We give below an example of semilocal ??-preinvex function, which is neither a semilocal ??-convex function nor a semi-??-preinvex function.

Example 4.4. Let the map ??:????? be defined as ?????0??(??)=if1??<0,if??1<??=2,if0=??=1or??>2,(4.4) and the map ??:??×????? be defined as ?0??(??,??)=if??=??,1-??if?????.(4.5) Obviously, ?? is a local star-shaped ??-convex set and a local star-shaped ??-invex set with respect to ??. Let ??:????? be defined as ?????0??(??)=if11<??=2,if??>2,-??+1if0=??=1,-??+2if??<0.(4.6)
We can prove that ?? is semilocal ??-preinvex on ?? with respect to ??. However, when x0=2, ??0=3, and for any ???(0,1], there exists a sufficiently small ??0?(0,??] satisfying ?????0?????0?+?1-??0??????0???=??3-2??0?=1>1-??0=??0?????0?+?1-??0??????0?.(4.7) That is, ??(??) is not a semilocal ??-convex function on ??.
Similarly, taking ??1=1, ??1=4, we have ????????1?+??1????????1????,??1???=??(4)=1>1-??1=??1?????1?+?1-??1??????1?,(4.8) for some ??1?[0,1].
Thus, ??(??) is not a semi-??-preinvex function on ?? with respect to ??.

Theorem 4.5. Let ??:?????????? be a local ??-preinvex function on a local star-shaped ??-invex set ?? with respect to ??, then ?? is a semilocal ??-preinvex function if and only if ??(??(??))=??(??), for all ?????.

Proof. Suppose that ?? is a semilocal ??-preinvex function on set ?? with respect to ??, then for each pair of points ??,????? (with a maximal positive number ??(??,??)=1 satisfying (3.1)), there exists a positive number ??(??,??)=??(??,??) satisfying [].??(??(??)+????(??(??)),??(??))=????(??)+(1-??)??(??),???0,??(??,??)(4.9) By letting ??=0, we have ??(??(??))=??(??), for all ?????.
Conversely, assume that ?? is a local ??-preinvex function on a local star-shaped ??-invex set ??, then for any ??,?????, there exist ??(??,??)?(0,1] satisfying (3.1) and ??(??,??)?(0,??(??,??)] such that [].??(??(??)+????(??(??),??(??)))=????(??(??))+(1-??)??(??(??)),????0,??(??,??)(4.10) Since ??(??(??))=??(??), for all ?????, then [].??(??(??)+????(??(??),??(??)))=????(??)+(1-??)??(??),????0,??(??,??)(4.11) The proof is completed.

Remark 4.6. A local ??-preinvex function on a local star-shaped ??-invex set with respect to ?? is not necessarily a semilocal ??-preinvex function.

Example 4.7. Let ??, ??, and ?? be the same as the ones of Example 3.3 and ??:????? be defined by ??(??)=??2, then ?? is local ??-preinvex on ?? with respect to ??.
Since ??(??(2))=16>??(2)=4, from Theorem 4.5, it follows that ?? is not a semilocal ??-preinvex function.

Theorem 4.8. Let ??:??????? be a semilocal ??-preinvex function on a local star-shaped ??-invex set ??????? with respect to ??, and let ??:????? be a nondecreasing and convex function, then ??(??(??)) is semilocal ??-preinvex on ?? with respect to ??.

The proof is easy and is omitted.

Theorem 4.9. If the functions ????:???????(??=1,2,,??) are all semilocal ??-preinvex on a local star-shaped ??-invex set ??????? with respect to the same ??, then the function ???(??)=????=1????????(??) is semilocal ??-preinvex on ?? with respect to ?? for all ????=0, ??=1,2,,??.

Proof. Since ?? is a local star-shaped ??-invex set with respect to ??, then for all ??,?????, there exists a positive number ??(??,??)=1 such that [].??(??)+????(??(??),??(??))???,????0,??(??,??)(4.12) On the other hand, ????(??=1,2,,??) are all semilocal ??-preinvex on ?? with respect to the same ??; thus, there exist positive numbers ????(??,??)=??(??,??) such that ????(??(??)+????(??(??),??(??)))=??????(??)+(1-??)?????(??),????0,?????(??,??),??=1,2,,??.(4.13) Now, letting ??(??,??)=min????(??,??),??=1,2,,??, we have ?????=1????????(??(??)+????(??(??),??(??)))=???????=1????????(??)+(1-??)?????=1????????[].(??),????0,??(??,??)(4.14) That is, ??(??) is semilocal ??-preinvex on ??with respect to ??.

Definition 4.10. The set ??={(??,??):??????????,?????} is said to be a local star-shaped ??-invex set with respect to ?? corresponding to ???? if there are two maps ??, ?? and a maximal positive number ??((??,??1),(??,??2))=1, for each (??,??1),(??,??2)??? such that ???(??)+????(??(??),??(??)),????1+(1-??)??2?????,????0,??????,??1?,???,??2.???(4.15)

Theorem 4.11. Let ??????? be a local star-shaped ??-invex set with respect to ??, then ?? is a semilocal ??-preinvex function on ?? with respect to ?? if and only if its epigraph ????={(??,??):?????,??(??)=??,?????} is a local star-shaped ??-invex set with respect to ?? corresponding to ????.

Proof. Assume that ?? is semilocal ??-preinvex on ?? with respect to ?? and (??,??1),(??,??2)?????, then ??,?????, and ??(??)=??1, ??(??)=??2. Since ?? is a local star-shaped ??-invex set, there is a maximal positive number ??(??,??)=1 such that ??(y[].)+????(??(??),??(??))???,????0,??(??,??)(4.16) In addition, in view of ?? being a semilocal ??-preinvex function on ?? with respect to ??, there is a positive number ??(??,??)=??(??,??) such that ??(??(??)+????(??(??),??(??)))=????(??)+(1-??)??(??)=????1+(1-??)??2[].,????0,??(??,??)(4.17) That is, (??(??)+????(??(??),??(??)),????1+(1-??)??2)?????, for all ???[0,??(??,??)].
Therefore, ????={(??,??):?????,??(??)=??,?????} is a local star-shaped ??-invex set with respect to ?? corresponding to ????.
Conversely, if ???? is a local star-shaped ??-invex set with respect to ?? corresponding to ????, then for any points (??,??(??)),(??,??(??))?????, there is a maximal positive number ??((??,??(??)),(??,??(??)))=1 such that (??(??)+????(??(??),??(??)),????(??)+(1-??)??(??))?????[].,????0,??((??,??(??)),(??,??(??)))(4.18) That is, ??(??)+????(??(??),??(??))???, [].??(??(??)+????(??(??),??(??)))=????(??)+(1-??)??(??),????0,??((??,??(??)),(??,??(??)))(4.19) Thus, ?? is a local star-shaped ??-invex set, and ?? is a semilocal ??-preinvex function on ?? with respect to ??.

Theorem 4.12. If ?? is a semilocal ??-preinvex function on a local star-shaped ??-invex set ??????? with respect to ??, then the level set ????={?????:??(??)=??} is a local star-shaped ??-invex set for any ?????.

Proof. For any ????? and ??,???????, then ??,????? and ??(??)=??, ??(??)=??. Since ?? is a local star-shaped ??-invex set, there is a maximal positive number ??(??,??)=1 such that [].??(??)+????(??(??),??(??))???,????0,??(??,??)(4.20) In addition, due to the semilocal ??-preinvexity of ??, there is a positive number ??(??,??)=??(??,??) such that [].??(??(??)+????(??(??),??(??)))=????(??)+(1-??)??(??)=????+(1-??)??=??,????0,??(??,??)(4.21) That is, ??(??)+????(??(??),??(??))?????, for all ???[0,??(??,??)].
Therefore, ???? is a local star-shaped ??-invex set with respect to ?? for any ?????.

Theorem 4.13. Let ?? be a real-valued function defined on a local star-shaped ??-invex set ???????, then ?? is a semilocal ??-preinvex function with respect to ?? if and only if for each pair of points ??,????? (with a maximal positive number ??(??,??)=1 satisfying (3.1)), there exists a positive number ??(??,??)=??(??,??) such that [],??(??(??)+????(??(??),??(??)))<????+(1-??)??,????0,??(??,??)(4.22) whenever ??(??)<??, ??(??)<??.

Proof. Let ??,????? and ??,????? such that ??(??)<??, ??(??)<??. Due to the local star-shaped ??-invexity of ??, there is a maximal positive number ??(??,??)=1 such that [].??(??)+????(??(??),??(??))???,????0,??(??,??)(4.23) In addition, owing to the semilocal ??-preinvexity of ??, there is a positive number ??(??,??)=??(??,??) such that [].??(??(??)+????(??(??),??(??)))=????(??)+(1-??)??(??)<????+(1-??)??,????0,??(??,??)(4.24)
Conversely, let (??,??)?????, (??,??)????? (see epigraph ???? in Theorem 4.11), then ??,?????, ??(??)=??, and ??(??)=??. Hence, ??(??)<??+?? and ??(??)<??+?? hold for any ??>0. According to the hypothesis, for ??,????? (with a positive number ??(??,??)=1 satisfying (3.1)), there exists a positive number ??(??,??)=??(??,??) such that [].??(??(??)+????(??(??),??(??)))<????+(1-??)??+??,????0,??(??,??)(4.25) Let ???0+, then [].??(??(??)+????(??(??),??(??)))=????+(1-??)??,????0,??(??,??)(4.26) That is, (??(??)+????(??(??),??(??)),????+(1-??)??)?????, for all ???[0,??(??,??)].
Therefore, ???? is a local star-shaped ??-invex set corresponding to ????.
From Theorem 4.11, it follows that ?? is semilocal ??-preinvex on ?? with respect to ??.

5. Nonlinear Programming

In this section, we discuss the optimality conditions and Mond-Weir type duality for nonlinear programming involving semilocal ??-preinvex and related functions.

We firstly consider the nonlinear programming problem without constraint as follows:(P)min??(??),?????,(5.1) where ?? is a local star-shaped ??-invex set and the objective function ?? is a semilocal ??-preinvex function on ?? with respect to ??.

Theorem 5.1. The following statements hold for programming (??).(i)The optimal solution set ?? for (??) is a local star-shaped ??-invex set with respect to ??.(ii)If ??0 is a local minimum for (??) and ??(??0)=??0, then ??0 is a global minimum for (??).(iii)If the real-valued function ?? is a strict semilocal ??-preinvex function on ?? with respect to ??, then the global optimal solution for (??) is unique.

Proof. (i) Assume that ??,?????, then ??,????? and ??(??)=??(??). On account of ?? being a local star-shaped ??-invex set with respect to ??, there is a maximal positive number ??(??,??)=1 such that [].??(??)+????(??(??),??(??))???,????0,??(??,??)(5.2) Besides, due to semilocal ??-preinvexity of ??, there is a positive number ??(??,??)=??(??,??) such that ??(??(??)+????(E[].(??),??(??)))=????(??)+(1-??)??(??)=??(??),????0,??(??,??)(5.3) From the optimality of ??, we have ??(??(??)+????(??(??),??(??)))=??(??).
Hence, ??(??(??)+????(??(??),??(??)))=??(??), that is, ??(??)+????(??(??),??(??))???, for all ???[0,??(??,??)].
This shows that ?? is a local star-shaped ??-invex set with respect to ??.
(ii) Assume that ????(??0) is a neighbourhood of ??0 with radius ??>0, and ?? attains its local minimum at ??0?????(??0)n??. For ??,??0???, there is a maximal positive number ??(??,??0)=1 such that ??(??0)+????(??(??),??(??0))???, for all ???[0,??(??,??0)].
Moreover, there is a positive number ??(??,??0)=??(??,??0) such that ????????0???????+????(??),??0??????=????(??)+(1-??)??0???,????0,????,??0.??(5.4) Owing to ??(??0)=??0, so for sufficiently small ??>0, ?????0???????+????(??),??0??????????0?n??.(5.5) Thus, ??(??0)=??(??(??0)+????(??(??),??(??0)))=????(??)+(1-??)??(??0), namely, ??(??0)=??(??).
This means that ??0 is a global minimum for (P).
(iii) By contradiction, assume that ??1,??2??? are two global optimal solutions for (P) and ??1???2. For ??1,??2???, there is a maximal positive number ??(??1,??2)=1 such that ?????2???????+????1????,??2?????????,????0,??1,??2.??(5.6) Furthermore, there is a positive number ??(??1,??2)=??(??1,??2) such that ????????2???????+????1????,??2??????<????1?+???(1-??)??2????=??1?????,????0,??1,??2.??(5.7) This contradicts the fact that ??1 is a global optimal solution for (P).
Therefore, the global optimal solution for (P) is unique.

Theorem 5.2. Let ????? and ??(??)=??. If ?? is differentiable on ??, then ?? is a minimum for programming (??) if and only if ?? satisfies the inequality ???(??)????(??(??),??)=0, for all ?????.

Proof. Assume that ?? is a minimum for (P). Since ?? is a local star-shaped ??-invex set with respect to ??, for any ?????, there is a maximal positive number ??(??,??)=1 such that ].??(??)+????(??(??),??(??))???,????(0,??(??,??)(5.8) From the differentiability of ?? and ??(??)=??, we get ??(??)=??(??(??)+????(??(v),??(??)))=??(??)+?????(??)????(??(??),??)+??(??).(5.9) Dividing the inequality above by ?? and letting ???0+, we have ???(??)????(??(??),??)=0.(5.10)
Conversely, if ???(??)????(??(??),??)=0, owing to semilocal ??-preinvexity of ?? on ??, there is a positive number ??(??,??)=??(??,??) such that ],??(??(??)+????(??(??),??(??)))=????(??)+(1-??)??(??),????(0,??(??,??)(5.11) which together with ??(??)=?? implies ??(??)-??(??)=??(??+????(??(??),??))-??(??)??.(5.12) Letting ???0+ in the inequality above, we obtain ??(??)-??(??)=???(??)????(??(??),??)=0.(5.13) This follows that ?? is a minimum for (P).

Next, we consider the optimization problem with inequality constraint(NP)?????min??(??)s.t.????(??)=0,?????,?????.(5.14)

Denote the feasible set of (NP) by ??0={?????,????(??)=0,?????}, where ??={1,2,,??}, and ??????? is an open local star-shaped ??-invex set with respect to ??.

If the constraint functions ????(??) (?????) are all semilocal ??-preinvex on ?? with respect to the same map ??, then, from Theorem 4.12 and Proposition 3.8, we can conclude that the feasible set ??0 is a local star-shaped ??-invex set with respect to ??. Moreover, from Theorem 5.1, we can obtain the following theorem easily.

Theorem 5.3. Assume that ??,????(?????) are all semilocal ??-preinvex on ?? with respect to ??, then(i)??0 is a local star-shaped ??-invex set with respect to ??;(ii) the optimal solution set ?? for (NP) is a local star-shaped ??-invex set with respect to ??;(iii) if ??0 is a local minimum for (NP) and ??(??0)=??0, then ??0 is a global minimum for (NP);(iv) if the real-valued function ?? is a strict semilocal ??-preinvex function on ?? with respect to ??, then the global optimal solution for (NP) is unique.

For convenience of discussion, we give the following notation:?????(??)=???(??),?????,???????(??)=???,(??),?????where?????.(5.15) For ??*???0, denote ??(??*)={?????:????(??*)=0}, ??(??*)=?????(??*).

To discuss the necessary optimality conditions for the corresponding programming, we first give a lemma as follows.

Lemma 5.4. Let ??* be a local optimal solution for (????). Assume that ???? is continuous at ??* for any ?????(??*), and ??, ????(??*) possess the directional derivatives at ??* along the direction ??(??(??),??*) for each ?????, then the system: ??'???*?;????(??),??*????<0,???(??*)???*?;????(??),??*??<0(5.16) has no solution in ??, where ??'(??*;??) denotes the directional derivative of ?? at ??* along the direction ?? and ?????(??*)(??*;??)=(?????(??*;??),?????(??*)).

The proof of this lemma is similar to the one of [10, Lemma 13].

Theorem 5.5. Let ??* be a local optimal solution for (????). Assume that functions ???? are continuous at ??* for any ?????(??*), and ??, ?? possess the directional derivatives with respect to ??(??(??),??*) at ??* for each ?????. If (??'(??*;??(??(??),??*)),?????(??*)(??*;??(??(??),??*))) is a convex-like function and ??(??*)=??*, then there are ??*0???, ??*????? such that ??*0??????*?;????(??),??*+????*????????*?;????(??),??*??=0,??????,(5.17)??*???????*????=0,??*????=0,0?*0,??*?=0.(5.18) Additionally, if ?? is a semilocal ??-preinvex function on ?? with respect to ?? and there is ????? such that ??(??)<0, then there exists ??*????? such that ??????*???;??(??),??*??+??*????????*???;??(??),??*??=0,??????,(5.19)??*???????*????=0,??*?=0,??*=0.(5.20)

Proof. Define vector function ??(??)=(??'(??*;??(??(??),??*)),?????(??*)(??*;??(??(??),??*))). Then ??(??) is a convexlike function. By Lemma 5.4, the system ??(??)<0 has no solution in ??. Thus, from Lemma 2.11, there are ??*0???,??*??(??*)???|??(??*)| such that ??*0??????*?;????(??),??*+????*????(??*)?????(??*)???*?;????(??),??*?????=0,??????,0?*0,??*??(??*)?=0.(5.21) Hence, by letting ??*=(??*??(??*),0??(??*)), we further have ??*0??????*?;????(??),??*+????*????????*?;????(??),??*??=0,??????,??*???????*????=0,??*????=0,0?*0,??*?=0.(5.22) Subsequently, we testify that ??*0?0, and if this is not true, we get from above ??*????????*?;????(??),??*??=0,??????,??*???????*????=0,??*?=0,0???*=0.(5.23) On account of ?? being semilocal ??-preinvex on ?? with respect to ?? and ??(??*)=??*, from Proposition 5.9(i) below, we have ??(??)-??(??*)=??'(??*;??(??(??),??*)).
So ??*????(??)=0. But this contradicts the fact that ??(??)<0 and ??*>0.
Thus, ??*0>0. Dividing (5.17) and the first equality of (5.18) by ??*0 and letting ??*=??*???*0, we know that (5.19) and (5.20) hold.
Consequently, the whole proof is finished.

To discuss the sufficient optimality conditions for (NP), we further generalize the concept of semilocal ??-preinvex function as follows.

Definition 5.6. A real-valued function ?? defined on a local star-shaped ??-invex set ??????? is said to be quasisemilocal ??-preinvex (with respect to ??) if for all ??,????? (with a maximal positive number ??(??,??)=1 satisfying (3.1)) satisfying ??(??)=??(??), there is a positive number ??(??,??)=??(??,??) such that [].??(??(??)+????(??(??),??(??)))=??(??),????0,??(??,??)(5.24)
The definition of quasi-semilocal ??-preinvex of a vector function ??:????????? is similar to the one for a vector semilocal ??-preinvex function.

Definition 5.7. A real-valued function ?? defined on a local star-shaped ??-invex set ??????? is said to be pseudosemilocal ??-preinvex (with respect to ??) if for all ??,????? (with a maximal positive number ??(??,??)=1 satisfying (3.1)) satisfying ??(??)<??(??), there are a positive number ??(??,??)=??(??,??) and a positive number ??(??,??) such that [].??(??(??)+????(??(??),??(??)))=??(??)-????(??,??),????0,??(??,??)(5.25)
The definition of pseudo-semilocal ??-preinvex of a vector function ??:????????? is similar to the one for a vector semilocal ??-preinvex function.

Remark 5.8. Every semilocal ??-preinvex function on a local star-shaped ??-invex set ?? with respect to ?? is both a quasi-semilocal ??-preinvex function and a pseudo-semilocal ??-preinvex function.

We now present one of their elementary properties.

Proposition 5.9. Let ?? be a real-valued function on a local star-shaped ??-invex set ???????, and ?? possesses directional derivative with respect to the direction ??(??(??),??) at ?? for all ??,?????. If ??(??)=??, then the following statements hold true:(i) if ?? is semilocal ??-preinvex on ?? with respect to ??, then ???(??;??(??(??),??))=??(??)-??(??),(ii)if ?? is quasi-semilocal ??-preinvex on ?? with respect to ??, then ??(??)=??(??) implies that ??'(??;??(??(??),??))=0,(iii)if ?? is pseudo-semilocal ??-preinvex on ?? with respect to ??, then ??(??)<??(??) implies that ??'(??;??(??(??),??))<0.

The proof is obvious by using the related definitions and is omitted.

Theorem 5.10. Let ??*???0 and ??(??*)=??*. Suppose that ??,?? possess directional derivatives with respect to the direction ??(??(??),??*) at ??* for any ?????, and assume that there is ??*????? such that (5.19) and (5.20) hold. If ?? is pseudo-semilocal ??-preinvex on ?? and ????(??*) is quasi-semilocal ??-preinvex on ?? with respect to ??, then ??* is an optimal solution for (????).

Proof. Due to ????(??*)(??)=????(??*)(??*)=0, for all ?????0, it follows from Proposition 5.9(ii) that ?????(??*)(??*,??(??(??),??*))=0, for all ?????0, which together with ??*??(??*)=0 implies ??*????(??*)?????(??*)???*???,??(??),??*??=0,??????0.(5.26) Moreover, using ??*????(??*)=0, ??(??*)=0, and ??*=0, we get ??*????????*???;??(??),??*??=0,??????0.(5.27) Therefore, from (5.19), we have ???(??*;??(??(??),??*))=0, for all ?????0.
Thus, from Proposition 5.9(iii), this implies ??(??)=??(??*), for all ?????0.
That is, ??* is an optimal solution for (NP).

Theorem 5.11. Let ??*???0 and ??(??*)=??*. Suppose that ??,?? possess directional derivatives with respect to the direction ??(??(??),??*) at ??* for any ?????, and there is a ??*????? such that (5.19) and (5.20) hold. If (??+??*????(??*)????(??*)) is pseudo-semilocal ??-preinvex on ?? with respect to ??, then ??* is an optimal solution for (????).

Proof. Considering ??*????(??*)=0, ??(??*)=0, ??*=0, and the given conditions, we have (??+??*????(??*)????(??*))'(??*;??(??(??),??*))=???(??*;??(??(??),??*))+??*????'(??*;??(??(??),??*))=0, for all ?????0. Hence, from Proposition 5.9(iii), we get ???+??*????(??*)????(??*)??(??)=??+??*????(??*)????(??*)????*?,??????0.(5.28) The inequality above together with ??*????(??*)????(??*)(??*)=0 follows: ??(??)+??*????(??*)????(??*)???(??)=??*?,??????0.(5.29) On account of ??*??(??*)=0 and ????(??*)(??)=0, we obtain ?????(??)=??*?,??????0.(5.30) Therefore, ??* is an optimal solution for (NP).

The following conclusion is a direct corollary of Theorem 5.10 or Theorem 5.11.

Corollary 5.12. Let ??*???0 and ??(??*)=??*. Suppose that ??,?? possess directional derivatives with respect to the direction ??(??(??),??*) at ??* for any ?????, and assume that there is a ??*????? such that (5.19) and (5.20) hold. If ?? and ????(??*) are semilocal ??-preinvex functions on ?? with respect to ??, then ??* is an optimal solution for (????).

Finally, we consider the following Mond-Weir type dual problem of (NP):(DP)???????max??(??)s.t.??'(??;??(??(??),??))+?????????(??;??(??(??),??))=0,??????,????(??)=0,???????,??=0,?????.(5.31)

Theorem 5.13 (weak duality). Let ?? and (??,??) be arbitrary feasible solutions of (????) and (????), respectively. If ?? and ?? are all semilocal ??-preinvex functions on ?? with respect to ??, and they possess directional derivatives with respect to the direction ??(??(??),??) at ??, where ??(??)=??, ?????, then ??(??)=??(??).

Proof. Considering ?? and ?? being semilocal ??-preinvex on ?? with respect to ?? and ??(??)=??, we get from Proposition 5.9(i) ??(??)=??(??)+???(??;??(??(??),??)),??(??)=??(??)+???(??;??(??(??),??)).(5.32) Combining the first constraint condition of (DP) and the inequalities above, we have ??(??)=??(??)-??????'(??;??(??(??),??))=??(??)+????(??(??)-??(??)).(5.33) Hence, on account of ??=0,??(??)=0, and ??????(??)=0, we obtain ??(??)=??(??).

Theorem 5.14 (strong duality). Assume that ??* is an optimal solution for (NP), ??(??*)=??*, and ??(??)=?? for any feasible point (??,??) of (DP). Suppose that ?? and ?? are semilocal ??-preinvex on ?? with respect to ?? and ???? is continuous at ??* for any ?????(??*), and they possess directional derivatives with respect to the direction ??(??(??),??*) at ??* and the direction ??(??*,??) at ??, respectively, where ?????. Further, assume that there is ????? such that ??(??)<0. If ???(??*;??(??(??),??*)),?????(??*)(??*;??(??(??),??*)) is a convex-like function, then there is a ??*????? such that (??*,??*) is an optimal solution for (DP).

Proof. From the assumptions and Theorem 5.5, we can conclude that there is ??*=0 such that (??*,??*) is a feasible point for (????). Assume that (??,??) is a feasible solution of (????). On account of ?? and ?? being semilocal ??-preinvex on ?? with respect to ?? and ??(??)=??, we get from Proposition 5.9(i) ?????*?-??(??)=??'??????;??*???,????,??*?-??(??)=?????????;??*.,????(5.34) Combining the first constraint condition of (DP) and the relationships above, we have ?????*?-??(??)=-??????'??????;??*,????=??????????(??)-??*.??(5.35) Noticing that ??=0, ??(??*)=0, and ??????(??)=0, we know ??(??*)=??(??).
Therefore, (??*,??*) is an optimal solution for (DP).

Theorem 5.15 (converse duality). Suppose that ??*???0 and (??,??) is a feasible point for (DP). Further, suppose that ?? and ?? are semilocal ??-preinvex on ?? with respect to ??, and ??, ?? possess directional derivatives with respect to the direction ??(??(??),??) at ?? for any ?????. If ??(??*)=??(??) and ??(??)=??, then ??* is an optimal solution for (NP).

Proof. Since ?? and ?? are semilocal ??-preinvex on ?? with respect to ?? and ??(??)=??, we have from Proposition 5.9(i) ???(??)-?????=??'????;????(??),?????,??(??)-?????=???????;????(??),????,??????0.(5.36) On account of (??,??) being a feasible point for (DP), we get from the first constraint inequality of (DP) and the two relationships above ???(??)-?????=-??????'????;????(??),??=??????????????.-??(??)(5.37) This together with ??=0, ??(??)=0, ??(??*)=??(??), and ??????(??)=0 follows that ?????(??)=??*?.(5.38) Thus, ??* is an optimal solution for (NP).

Acknowledgments

This work was partially supported by NSF of China (60974082) and partially supported by Foundation Project of China Yangtze Normal University.