1 Introduction

Equilibrium problem was introduced by Blum and Oettli [1] (see, also Noor and Oettli [2]). It provides a unified model of several classes of problems, for example, optimization problems, problems of Nash equilibrium, fixed point problems, variational inequalities, and complementarity problems. In recent years, there has been an increasing interest in the study of vector equilibrium problems. A lot of results for existence of solutions for vector equilibrium problems and vector variational inequalities have been established by many authors in different ways. For details, we refer the reader to various studies (see, e.g., [315] and the references therein).

Let X and Z be real locally convex Hausdorff spaces, KX be a nonempty subset, and CZ be a closed convex pointed cone. Let F : K × K → 2 Z be a given set-valued mapping. Ansari et al. [16] introduced two types of set-valued vector equilibrium problems as follows. The first type is the weak vector equilibrium problem: finding xK such that

F ( x , y ) - int C , y K .
(1.1)

The second type is the strong vector equilibrium problem (SVEP): finding xK such that

F ( x , y ) C , y K .
(1.2)

If int C ≠ ∅ and x satisfies (1.1), then we call x a weak efficient solution for the vector equilibrium problem. If x satisfies (1.2), then we call x a strong efficient solution for the vector equilibrium problem.

It is worth mentioning that many existing results of the vector equilibrium problem are obtained under the assumption that the dual C* of the ordering cone C has a weak* compact base. As we know, for a normed space, the dual cone C* has a weak* compact base if and only if int C ≠ ∅ (see [17]). However, in many cases, the ordering cone has an empty interior. For example, in the classical Banach spaces lp and Lp (Ω), where 1 < p < ∞, the standard ordering cone has an empty interior. Thus, it is interesting for the study of the existence of solutions and the properties of the solution sets for this case.

On the other hand, it is well known that a strong efficient solution of vector equilibrium problem is an ideal solution. It is better than other solutions, such as efficient solution, weak efficient solution, proper efficient solution, and supper efficient solution (see [18]). Hence, it is important to study the existence of strong efficient solution and the properties of the strong efficient solution set. Very recently, Long et al. [19] gave an existence theorem for generalized strong vector quasiequilibrium problem (GSVQEP) and discussed the stability of strong efficient solutions. Somyot and Kanokwan [20] derived an existence theorem for system of generalized strong vector quasiequilibrium problem (SGSVQEP) which extends the main results of Long et al. [19].

Motivated and inspired by the research studies mentioned above, in this article, we consider a type of symmetric strong vector quasiequilibrium problem (SSVQEP) without assuming that the dual of the ordering cone has a weak* compact base. Let X, Y, and Z be real locally convex Hausdorff topological vector spaces, KX and DY be nonempty subsets, and CZ be a nonempty closed convex cone. Suppose that S1, S2 : K × K → 2 K , T1, T2 : K × K → 2 D and F1, F2 : K × D × K → 2 Z are set-valued mappings. We consider the following SSVQEP: finding ( x ̄ , ū ) K×K and ȳ T 1 ( x ̄ , ū ) , v ̄ T 2 ( x ̄ , ū ) such that x ̄ S 1 ( x ̄ , ū ) , ū S 2 ( x ̄ , ū ) ,

F 1 ( x ̄ , ȳ , z ) C , z S 1 ( x ̄ , ū )

and

F 2 ( ū , v ̄ , z ) C , z S 2 ( x ̄ , ū ) .

We call this ( x ̄ , ū ) a strong efficient solution for the SSVQEP.

In this article, we establish an existence theorem of the solutions for the SSVQEP by using Kakutani-Fan-Glicksberg fixed point theorem. We also discuss the closedness of the solution set for this problem. The results presented in this article improve and extend some known results according to Long et al. [19], Somyot and Kanokwan [20], and Wang et al. [21].

2 Preliminary results

Throughout this article, we suppose that X, Y, and Z are real locally convex Hausdorff topological vector spaces, KX and DY are nonempty compact convex subsets, and CZ is a nonempty closed convex cone. Suppose that S1, S2 : K × K → 2 K , T1, T2 : K × K → 2 D and F1, F2 : K × D × K → 2 Z are set-valued mappings.

For our main results, we need some definitions and lemmas as follows.

Definition 2.1. Let X and Y be two topological vector spaces and T : X → 2 Y be a set-valued mapping.

  1. (i)

    T is said to be upper semicontinuous at xX if, for any neighborhood U of T(x), there exists a neighborhood V of x such that T(t) ⊂ U, for all tV. T is said to be upper semicontinuous on X if it is upper semicontinuous at each xX.

  2. (ii)

    T is said to be lower semicontinuous at xX if, for any open set U with T(x) ∩ U ≠ ∅, there exists a neighborhood V of x such that T(x') ∩ U ≠ ∅, for all x' ∈ V. T is said to be lower semicontinuous on X if it is lower semicontinuous at each xX.

  3. (iii)

    T is said to be continuous on X if it is both upper semicontinuous and lower semicontinuous on X.

  4. (iv)

    T is said to be closed if, Graph(T) = {(x, y): xX, yT(x)} is a closed subset in X × Y.

Definition 2.2. Let W be a topological vector space and DW be a nonempty set. A set-valued mapping G : D → 2 Z is said to be type I C-lower semicontinuous at x0 if, for any neighborhood U of 0 in Z, there exists a neighborhood U(x0) of x0 such that

G ( x 0 ) G ( x ) + U - C , x U ( x 0 ) D .

Definition 2.3. Let W be a topological vector space and DW be a nonempty set. A set-valued mapping G : D → 2 Z is said to be type II C-lower semicontinuous at x0 if, for each zG(x0) and any neighborhood U of 0 in Z, there exists a neighborhood U(x0) of x0 such that

G ( x ) ( z + U - C ) , x U ( x 0 ) D .

Definition 2.4. Let W be a topological vector space and DW be a nonempty convex set. A set-valued mapping G : D → 2 Z is said to be C-properly quasiconvex if, for any x, yD, t ∈ [0, 1], we have

either G ( x ) G ( t x + ( 1 - t ) y ) + C or G ( y ) G ( t x + ( 1 - t ) y ) + C .

Definition 2.5. Let W be a topological vector space and DW be a nonempty set. A set-valued mapping G : D → 2 Z is said to be C-convex if, for any x, yD and t ∈ [0, 1], one has

G ( t x + ( 1 - t ) y ) t G ( x ) + ( 1 - t ) G ( y ) - C .

G is said to be C-concave if -G is C-convex.

Definition 2.6. Let X be a Hausdorff topological vector space and KX be a nonempty set. A set-valued mapping G : K → 2 X is said to be a KKM mapping if, for any finite set {x1, ..., x n } ⊂ K, the relation

co { x 1 , , x n } i = 1 n G ( x i )

holds, where co{x1, ..., x n } denotes the convex hull of {x1, ..., x n }.

Lemma 2.1. ([22]) Let X and Y be two Hausdorff topological spaces and T : X → 2 Y be a set-valued mapping.

  1. (i)

    If T is upper semicontinuous with closed values, then T is closed.

  2. (ii)

    If T is closed and Y is compact, then T is upper semicontinuous.

Lemma 2.2. (Kakutani-Fan-Glicksberg [23]) Let X be a locally convex Hausdorff topological vector space and K be a nonempty compact convex subset of X. Let T : K → 2 K be a upper semicontinuous set-valued mapping with nonempty closed convex values. Then, there exists x ̄ K such that x ̄ T ( x ̄ ) .

Lemma 2.3. ([24]) Let X and Y be two Hausdorff topological vector spaces and T : X → 2 Y be a set-valued mapping with compact values. Then, T is upper semicontinuous on xX if and only if for any set {x α } with x α x, and y α T(x α ), there exists yT(x), and a subset {y β } of {y α }, such that y β y.

Lemma 2.4. ([25]) Let D be a nonempty convex compact subset of Hausdorff topological vector space X and E be a subset of D × D such that

  1. (i)

    for each xD, (x, x) ∉ E;

  2. (ii)

    for each xD, {yD : (x, y) ∈ E} is convex;

  3. (iii)

    for each yD, {xD : (x, y) ∈ E} is open in D.

Then, there exists x ̄ D such that ( x ̄ , y ) E for all yD.

Lemma 2.5. ([26]) Let K be a nonempty subset of a topological vector space X and F : K → 2 X be a KKM mapping with closed values. Assume that there exists a nonempty compact convex subset B of K such that D= x B F ( x ) is compact. Then, x K F ( x ) .

3 Main results

In this section, we apply Kakutani-Fan-Glicksberg fixed point theorem to prove an existence theorem of solutions for the SSVQEP. Moreover, we prove the closedness of the solution set for this problem.

Lemma 3.1. Let W be a topological vector space and DW be a nonempty subset. Let G : D → 2 Z be a set-valued mapping.

  1. (i)

    If G is lower semicontinuous, then G is type II C-lower semicontinuous.

  2. (ii)

    If G is type I (-C)-lower semicontinuous, then G is type II C-lower semicontinuous.

  3. (iii)

    If G is single-valued mapping, then G is type I (-C)-lower semicontinuous ⇔ G is type II C-lower semicontinuous.

Proof. (i) It is easy to verify that the assertion (i) holds and so we omit the proof.

  1. (ii)

    Suppose that G is type I (-C)-lower semicontinuous at x 0D. Then, for any zG(x 0), and for any neighborhood U of 0 in Z, there exists a balanced neighborhood V of 0 in Z such that VU. Since G is type I (-C)-lower semicontinuous at x 0D, it follows that there exists a neighborhood U(x 0) of x 0 such that

    G ( x 0 ) G ( x ) + V + C , x U ( x 0 ) D .

For zG(x0), there exist yG(x'), vV, cC such that z = y + v + c, and so

y = z - v - c z - V - C = z + V - C z + U - C .

Thus,

G ( x ) ( z + U - C ) , x U ( x 0 ) D .

It follows that G is type II C-lower semicontinuous.

  1. (iii)

    Suppose that G is type II C-lower semicontinuous at x 0D. Then, for any neighborhood U of 0 in Z, there exists a balanced neighborhood V of 0 in Z such that VU. Since G is type II C-lower semicontinuous at x 0D, it follows that there exists a neighborhood U(x 0) of x 0 such that

    G ( x ) G ( x 0 ) + V - C , x U ( x 0 ) D .

Therefore,

G ( x 0 ) G ( x ) + V + C G ( x ) + U + C , x U ( x 0 ) D .

This shows that G is type I (-C)-lower semicontinuous. This completes the proof.

The following example shows that the converse of (i) of Lemma 3.1 is not true.

Example 3.1. Let the set-valued mapping F from R into its subsets be defined by F(0) = [0, 1] and F(x) = {0} for all x ≠ 0. Let C = R+ = [0, +∞). Then, it is easy to see that F is not lower semicontinuous at 0. In fact, we can find a point y0 = 1 ∈ F(0) = [0, 1] and a neighborhood U ( y 0 ) = ( 1 2 , 3 2 ) of y0 such that, for any neighborhood U(0) of 0, there exist some x0 ≠ 0 ∈ U(0) satisfying

F ( x 0 ) U ( y 0 ) = .

This shows that F is not lower semicontinuous at 0. However, we can show that F is type II C-lower semicontinuous at 0. In fact, for each yF(0) = [0, 1] and any neighborhood U of 0 in R, there exists ε0 > 0 such that (-ε0, ε0) ⊂ U. Hence, y + (-ε0, ε0) - C = (-∞, y + ε0). It is easy to see that, for any neighborhood U(0) of 0,

F ( x ) ( - , y + ε 0 ) , x U ( 0 ) .

Thus,

F ( x ) ( y + U - C ) , x U ( 0 ) ,

which shows that F is type II C-lower semicontinuous at 0.

Theorem 3.1. For each i ∈ {1, 2}, let S i : K × K → 2 K be continuous set-valued mappings with nonempty compact convex values and T i : K × K → 2 D be upper semicontinuous set-valued mappings with nonempty compact convex values. Let F i : K × D × K → 2 Z be set-valued mappings which satisfy the following conditions:

  1. (i)

    for all (x, y) ∈ K × D, F i (x, y, x) ⊂ C;

  2. (ii)

    for all (y, z) ∈ D × K, F i (·, y, z) are C-concave;

  3. (iii)

    for all (x, y) ∈ K × D, F i (x, y, ·) are C-properly quasiconvex;

  4. (iv)

    F i (·, ·, ·) are type II C-lower semicontinuous.

Then, the SSVQEP has a solution. Moreover, the solution set of the SSVQEP is closed.

Proof. For any (x, y, u, v) ∈ K × D × K × D, define mappings A, B : K × D × K → 2 K by

A ( x , y , u ) = { a S 1 ( x , u ) : F 1 ( a , y , z ) C , z S 1 ( x , u ) } ,
B ( x , v , u ) = { b S 2 ( x , u ) : F 2 ( b , v , z ) C , z S 2 ( x , u ) } .
  1. (I)

    For any (x, y, u) ∈ K × D × K, A(x, y, u) is nonempty.

Indeed, by the assumption, S1(x, u) is nonempty compact convex set for each (x, u) ∈ K × K. Set

E = { ( a , z ) S 1 ( x , u ) × S 1 ( x , u ) : F 1 ( a , y , z ) C } .

If E is empty, then it is clear that A(x, y, u) is nonempty. Thus, we consider that E is not empty. For any zS1(x, u), if (a, z) ∈ E, then there exists dF1(a, y, z) such that dC. Hence, there exists an open neighborhood U of 0 in Z such that (d + U) ∩ C = ∅ and so

( d + U - C ) C = .
(3.1)

By the type II C-lower semicontinuity of F1, there exists an open neighborhood U1 of a in S1(x, u) such that

F 1 ( a , y , z ) ( d + U - C ) , a U 1 S 1 ( x , u ) .
(3.2)

From (3.2), we know that there exists d' ∈ F1(a', y, z) such that d' ∈ d + U - C. By (3.1), d' ∉ C. Hence,

F 1 ( a , y , z ) C , a U 1 S 1 ( x , u ) .
(3.3)

Thus, for any zS1(x, z), {aS1(x, u): (a, z) ∈ E} is open in S1(x, u). For any aS1(x, u), (a, z1) ∈ E, (a, z2) ∈ E, t ∈ [0, 1], it follows that

F 1 ( a , y , z 1 ) C and F 1 ( a , y , z 2 ) C .
(3.4)

By condition (iii), we have

either F 1 ( a , y , z 1 ) F 1 ( a , y , t z 1 + ( 1 - t ) z 2 ) + C or F 1 ( a , y , z 2 ) F 1 ( a , y , t z 1 + ( 1 - t ) z 2 ) + C .
(3.5)

We claim that F1(a, y, tz1 + (1 - t)z2) ⊄ C. If not, then by (3.5), we have

either F 1 ( a , y , z 1 ) C or F 1 ( a , y , z 2 ) C ,

which contradicts (3.4). Hence, F1(a, y, tz1 + (1 - t)z2) ⊄ C. Thus, for any aS1(x, u), {zS1(x, u): (a, z) ∈ E} is convex in S1(x, u). The condition (i) implies that for any aS1(x, u), (a, a) ∉ E. By Lemma 2.4, there exists aS1(x, u) such that (a, z) ∉ E for all zS1(x, u) i.e., F1(a, y, z) ⊂ C for all zS1(x, u). Hence, A(x, y, u) ≠ ∅.

  1. (II)

    For any (x, y, u) ∈ K × D × K, A(x, y, u) is convex.

In fact, let a1, a2A(x, y, u), t ∈ [0, 1]. Then, a1, a2S1(x, u),

F 1 ( a 1 , y , z ) C , z S 1 ( x , u )
(3.6)

and

F 1 ( a 2 , y , z ) C , z S 1 ( x , u ) .
(3.7)

By the convexity of S1(x, u), we have ta1 + (1 - t)a2S1(x, y). It follows from (3.6) and (3.7) that

F 1 ( t a 1 + ( 1 - t ) a 2 , y , z ) t F 1 ( a 1 , y , z ) + ( 1 - t ) F 1 ( a 2 , y , z ) + C C + C + C C , z S 1 ( x , u ) .

Thus, ta1 + (1 - t)a2A(x, y, u). Therefore, A(x, y, u) is convex.

  1. (III)

    A is upper semicontinuous on K × D × K.

Since K is compact, we only need to show that A is a closed mapping. Let {(x α , y α , u α ): αI} ⊂ K × D × K be a set with (x α , y α , u α ) → (x, y, u) ∈ K × D × K. Let v α A(x α , y α , u α ) with v α v. We will show that vA(x, y, u). Since S1 is upper semicontinuous mapping with nonempty closed values, it follows that S1 is a closed mapping. It follows from v α S1(x α , u α ) and (x α , u α , v α ) → (x, u, v) that we have vS1(x, u). Now we claim that vA(x, y, u). If not, then there exists z1S1(x, u) such that

F 1 ( v , y , z 1 ) C .
(3.8)

Hence, there exists dF1(v, y, z1) such that dC, and so there exists an open neighborhood U of 0 in Z such that (d + U) ∩ C + ∅. Therefore,

( d + U - C ) C = .
(3.9)

Since F1 is type II C-lower semicontinuous, for dF1(v, y, z1) and U, there exists a neighborhood U(v, y, z1) of (v, y, z1) such that, for all ( v , y , z 1 ) U ( v , y , z 1 ) ( K × D × K ) ,

F 1 ( v , y , z 1 ) ( d + U - C ) .
(3.10)

Since (x α , u α ) → (x, u) and S is lower semicontinuous, for z1S1(x, u), there exists z α S1(x α , u α ) such that z α z1. Thus, (v α , y α , z α ) → (v, y, z1). It follows from (3.10) that there exists α0I such that, for αα0,

F 1 ( v α , y α , z α ) ( d + U - C ) .
(3.11)

From v α A(v α , y α , z α ), we have

F 1 ( v α , y α , z ) C , z S 1 ( x α , u α ) .

Because z α S1(x α , u α ), we get F1(v α , y α , z α ) ⊂ C. It follows from (3.9) that

F 1 ( v α , y α , z α ) ( d + U - C ) C ( d + U - C ) = ,

which contradicts (3.11). Hence, A is a closed mapping.

Similarly, we know for any (x, v, u) ∈ K × D × K, B is upper semicontinuous on K × D × K with nonempty closed convex values.

  1. (IV)

    Define the set-valued mappings H, G : K × D × K → 2K×Dby

    H ( x , y , u ) = ( A ( x , y , u ) , T 1 ( x , u ) ) , ( x , y , u ) K × D × K

and

G ( x , v , u ) = ( B ( x , v , u ) , T 2 ( x , u ) ) , ( x , v , u ) K × D × K .

Then, it is easy to see that H and G are upper semicontinuous mappings with nonempty closed convex values.

Define the set-valued mapping M : (K × D) × (K × D) → 2(K×D)×(K×D)by

M ( ( x , y ) , ( u , v ) ) = ( H ( x , y , u ) , G ( x , v , u ) ) , ( ( x , y ) , ( u , v ) ) ( K × D ) × ( K × D ) .

Then, we know that M is upper semicontinuous mapping with nonempty closed convex values. By Lemma 2.2, there exists a point ( ( x ̄ , ȳ ) , ( ū , v ̄ ) ) ( K × D ) × ( K × D ) such that ( ( x ̄ , ȳ ) , ( ū , v ̄ ) ) M ( ( x ̄ , ȳ ) , ( ū , v ̄ ) ) , that is

( x ̄ , ȳ ) H ( x ̄ , ȳ , ū ) , ( ū , v ̄ ) G ( x ̄ , v ̄ , ū ) .

This implies that x ̄ A ( x ̄ , ȳ , ū ) , ȳ T 1 ( x ̄ , ū ) , ūB ( x ̄ , v ̄ , ū ) , v ̄ T 2 ( x ̄ , ū ) . Hence, x ̄ S 1 ( x ̄ , ū ) , ȳ T 1 ( x ̄ , ū ) , ū S 2 ( x ̄ , ū ) , v ̄ T 2 ( x ̄ , ū ) ,

F 1 ( x ̄ , ȳ , z ) C , z S 1 ( x ̄ , ū )

and

F 2 ( ū , v ̄ , z ) C , z S 2 ( x ̄ , ū ) .

Next, we show that the solution set of the SSVQEP is closed. Let {(x α , u α ): αI} be a set in the set of solutions of SSVQEP with ( x α , u α ) ( x ̄ , ū ) , and so there exist y α T1(x α , u α ), v α T2(x α , u α ), x α S1(x α , u α ), u α S2(x α , u α ), such that

F 1 ( x α , y α , z ) C , z S 1 ( x α , u α )

and

F 2 ( u α , v α , z ) C , z S 2 x α , u α .

Since S1 and S2 are upper semicontinuous set-valued mappings with nonempty closed values, it follows from Lemma 2.1 that S1 and S2 are closed mappings. Thus, x ̄ S 1 ( x ̄ , ū ) and ū S 2 ( x ̄ , ū ) . Since T1 is upper semicontinuous set-valued mapping with nonempty compact values, by Lemma 2.3, there exist ȳ T 1 ( x ̄ , ū ) and a subset {y β } of {y α } such that y β ȳ. Similarly, there exist v ̄ T 2 ( x ̄ , ū ) and a subset {v γ } of {v α } such that v γ v ̄ . By the condition (iv), similar to the proof of the part (III), we have

F 1 ( x ̄ , ȳ , z ) C , z S 1 ( x ̄ , ū )

and

F 2 ( ū , v ̄ , z ) C , z S 2 ( x ̄ , ū ) .

Hence, ( x ̄ , ū ) belongs to the set of solutions of SSVQEP. Thus, the set of solutions of SSVQEP is closed set. This completes the proof.

Now we give an example to show Theorem 3.1 is applicable.

Example 3.2. Let X = Y = Z = R, C = [0, +∞) and K = D = [0, 1]. For each xK, uK, let S 1 ( x , u ) = [ x 2 , 1 ] , S 2 ( x , u ) = [ 0 , u + 1 2 ] , T 1 ( x , u ) = [ 0 , 1 - x 3 + 1 - u 2 ] and T 2 ( x , u ) = [ 0 , 1 - x 2 ] . Define the set-valued mappings F1 and F2 as follows:

F 1 ( x , y , z ) = [ x + y - z , + ) , ( x , y , z ) K × D × K

and

F 2 ( x , y , z ) = [ 2 x + 3 y - z , + ) , ( x , y , z ) K × D × K .

It is easy to verify that all the conditions in Theorem 3.1 are satisfied. By Theorem 3.1, we know that SSVQEP has a solution. Let M be the solution set of SSVQEP. Then,

M = { ( x ̄ , ū ) K × K : 4 x ̄ - 3 ū 1 , 3 ū - 3 x ̄ + 2 0 } .

It is easy to see that M is a closed subset of K × K.

For each i = {1, 2}, if we suppose that S i is a set-valued mapping from K to K and T i is a set-valued mapping from K to D, then similar to the proof of Theorem 3.1, we have the following corollary.

Corollary 3.1. Let S1, S2 : K → 2 K be continuous set-valued mappings with nonempty compact convex values and T1, T2 : K → 2 D be upper semicontinuous set-valued mappings with nonempty compact convex values. Let F1, F2 : K × D × K → 2 Z be set-valued mappings satisfy the conditions (i)-(iv) of Theorem 3.1. Then, the SGSVQEP has a solution, i.e., there exist ( x ̄ , ū ) K×K and ȳ T 1 ( ū ) , v ̄ T 2 ( x ̄ ) such that x ̄ S 1 ( x ̄ ) , ū S 2 ( ū ) ,

F 1 ( x ̄ , ȳ , z ) C , z S 1 ( x ̄ )

and

F 2 ( ū , v ̄ , z ) C , z S 2 ( ū ) .

Moreover, the solution set of the SGSVQEP is closed.

Remark 3.1. In [20], Somyot and Kanokwan also obtained an existence result for SGSVQEP. However, the assumptions of Theorem 3.1 in [20] are quite different from the ones in Corollary 3.1. The following example shows the case, where Corollary 3.1 is applicable, but the hypotheses of the corresponding theorem in [20] cannot be satisfied.

Example 3.3. Let X = Y = Z = R, C = [0, +∞) and K = D = [0, 1]. For each xK, uK, let S1(x) = [x, 1], S 2 ( x ) = [ 1 - x 2 , 1 2 ] , T1(x) = [1 - x, 1] and T 2 ( x ) = [ 0 , 1 + x 2 ] . Define the set-valued mappings F1 and F2 as follows:

F 1 ( x , y , z ) = 2 x + y 2 - z , + , ( x , y , z ) K × D × K

and

F 2 ( x , y , z ) = [ 3 x + y - 3 z , + ) , ( x , y , z ) K × D × K .

It is easy to verify that all the conditions in Corollary 3.1 are satisfied. Hence, by Corollary 3.1, SGSVQEP has a solution. Let N be the solution set of SGSVQEP. Then,

N = x ̄ , ū K × K : x ̄ 1 4 , 3 ū + x ̄ 2 - 1 0 .

It is easy to see that N is a closed subset of K × K. However, the hypothesis (i) of Theorem 3.1 in [20] is not satisfied. Thus, Theorem 3.1 in [20] is not applicable.

If we take S = S1 = S2, F = F1 = F2, and T = T1 = T2; then, from Corollary 3.1, we have the following corollary.

Corollary 3.2. Let S : K → 2 K be continuous set-valued mappings with nonempty compact convex values and T : K → 2 D be upper semicontinuous set-valued mappings with nonempty compact convex values. Let F : K × D × K → 2 Z be set-valued mapping which satisfies the conditions (i)-(iv) of Theorem 3.1. Then, the GSVQEP has a solution, i.e., there exist x ̄ K and ȳT ( x ̄ ) such that x ̄ S ( x ̄ ) and

F ( x ̄ , ȳ , z ) C , z S ( x ̄ ) .

Moreover, the solution set of the GSVQEP is closed.

Remark 3.2. In [19], Long et al. also obtained an existence result for GSVQEP. However, the assumptions in Corollary 3.2 are quite different from the ones in Theorem 3.1 in [19]. The following example shows the case, where Corollary 3.2 is applicable, but the hypotheses of the corresponding theorem in [19] cannot be satisfied.

Example 3.4. Let X = Y = Z = R, C = [0, +∞) and K = D = [0, 1]. For each xK, let S ( x ) = [ x 3 , 1 ] , T ( x ) = [ 0 , x 2 ] . Define the set-valued mapping F as follows:

F ( x , y , z ) = [ 3 x + 2 y - z , + ) , ( x , y , z ) K × D × K .

It is easy to verify that all the conditions in Corollary 3.2 are satisfied. Hence, by Corollary 3.2, GSVQEP has a solution. Let O be the solution set of GSVQEP. Then,

O = x ̄ K : x ̄ 1 4 .

It is easy to see that O is a closed subset of K. However, the hypothesis (i) of Theorem 3.1 in [19] is not satisfied. Thus, Theorem 3.1 in [19] is not applicable.

If for any xK, S(x) = T(x) ≡ K and F(x, y, z) := F(x, y), then GSVQEP collapses to SVEP. Next we give an existence theorem of SVEP on a noncompact set.

Theorem 3.2. Let X and Z be two real Hausdorff topological vector spaces, KX a nonempty closed convex subset and CZ a closed convex cone. Let F : K × K → 2 Z be a set-valued mapping. Suppose that

  1. (i)

    for any xK, F(x, x) ⊂ C;

  2. (ii)

    for any xK, the set {yK : F(x, y) ⊄ C} is empty or convex;

  3. (iii)

    for any yK, the set {xK : F(x, y) ⊂ C} is closed;

  4. (iv)

    there exist a nonempty compact subset E of K and a nonempty convex compact subset D of K such that, for each xK\E, there exists yD such that F(x, y) ⊄ C.

Then, the SVEP has a solution. Moreover, the solution set of the SVEP is compact.

Proof. We define G : K → 2 K as follows:

G ( y ) = { x K : F ( x , y ) C } .

It follows from condition (i) that for any yK, we have yG(y) and so G(y) ≠ ∅. We claim that G is a KKM mapping. Suppose to the contrary that there exists a finite subset {y1, ..., y n } of K, and there exists ȳ co { y 1 , , y n } such that ȳ i = 1 n G ( y i ) . Hence, ȳ= i = 1 n t i y i for some t i ≥ 0, 1 ≤ in, with i = 1 n t i =1, and ȳG ( y i ) for all i = 1, ..., n. Therefore,

F ( ȳ , y i ) C , i = 1 , , n .
(3.12)

Equation 3.12 implies that y i { z K , F ( ȳ , z ) C } , for all i = 1, ..., n. By condition (ii), we have

F ( ȳ , ȳ ) C ,

which contradicts condition (i). Hence, G is a KKM mapping. Applying conditions (iii) and (iv), we deduce that y D G ( y ) is a closed subset of E. Now, G satisfies all the assumptions of Lemma 2.5 and hence y K G ( y ) . This means that SVEP has a solution. By condition (iii), the solution set of SVEP is closed and by condition (iv), it is subset of the compact set E. Thus, the solution set of SVEP is compact. This completes the proof.

Remark 3.3. Theorem 3.2 is different from Theorem 3.1 of Wang et al. [21] in the following two aspects.

  1. (a)

    The condition (iv) in Theorem 3.2 is weaker than the condition (iv) in Theorem 3.1 of Wang et al. [21]; hence, Theorem 3.2 generalizes Theorem 3.1 of Wang et al. [21];

  2. (b)

    Theorem 3.2 is proved using Fan-KKM lemma, while Theorem 3.1 of Wang et al. [21] was proved using Brouwer fixed point theorem.

Example 3.5. Let X = Z = R, K = C = [0, +∞). Define the set-valued mapping F as follows:

F ( x , y ) = [ y - x + 1 , + ) , x , y K .

If we take E = [0, 1] ∪{2}, D = [0, 2], it is easy to verify that all the conditions in Theorem 3.2 are satisfied. Hence, by Theorem 3.2, SVEP has a solution. Let P be the solution set of SVEP. Then, P = [0, 1]. It is obvious that P is a compact subset of K.

Corollary 3.3. Let X, Z, K, C and F be as in Theorem 3.2. Assume that the conditions (i), (ii), and (iv) of Theorem 3.2 and the following condition holds:

(iii') for any yK, F(·, y) is type II C-lower semicontinuous.

Then, the SVEP has a solution. Moreover, the solution set of the SVEP is compact.

Proof. By Theorem 3.2, we only need to show that for any yK, the set

G ( y ) = { x K : F ( x , y ) C }

is closed.

Indeed, let {x α } ⊂ G(y) be an arbitrary set such that x α x0. We need to show that x0G(y). Since x α K and K is closed, we have x0K. In addition, for each α,

F ( x α , y ) C .

We claim that F(x0, y) ⊂ C. If not, there exists zF(x0, y) such that zC. Hence, there exists a neighborhood U of 0 in Z such that (z + U) ∩ C = ∅, which implies

( z + U - C ) C = .

By condition (iii'), we know that there exists α0 such that, for αα0,

F ( x α , y ) ( z + U - C ) .
(3.13)

Hence,

F ( x α , y ) ( z + U - C ) C ( z + U - C ) = ,

which contradicts (3.13). Hence, x0G(y) and so G(y) is closed. This completes the proof.

Remark 3.4. It follows from Lemma 3.1 that Corollary 3.3 generalizes Theorem 3.2 of Wang et al. [21].

Corollary 3.4. Let X, Z, K, C, and F be the same as in Theorem 3.2. Assume that the conditions (i), (iii), and (iv) of Theorem 3.2 and the following condition holds:

(ii') for any xK, F(x, ·) is C-properly quasiconvex.

Then, the SVEP has a solution. Moreover, the solution set of the SVEP is closed.

Proof. By Theorem 3.2, we only need to show that, for any xK, the set

G ( x ) = { y K : F ( x , y ) C }

is convex. Indeed, let y1, y2G(x), t ∈ [0, 1],

F ( x , y 1 ) C and F ( x , y 2 ) C .
(3.14)

By condition (iii), we have

either F ( x , y 1 ) F ( x , t y 1 + ( 1 - t ) y 2 ) + C or F ( x , y 2 ) F ( x , t y 1 + ( 1 - t ) y 2 ) + C .
(3.15)

We claim that F(x, ty1 + (1 - t)y2) ⊄ C. If not, then by (3.15), we have

either F ( x , y 1 ) C or F ( x , y 2 ) C ,

which contradicts (3.14). Hence, F(x, ty1 + (1 - t)y2) ⊄ C. Thus, ty1 + (1 - t)y2G(x), and so G(x) is convex. This completes the proof.