Skip to content

Advertisement

Journal of Inequalities and Applications

Journal of Inequalities and Applications Cover Image
Research
Open Access

Generalized strict feasibility and solvability for generalized vector equilibrium problem with set-valued map in reflexive Banach spaces

Journal of Inequalities and Applications20122012:66

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

©  Wang and Che; licensee Springer. 2012

Received: 26 November 2011

Accepted: 19 March 2012

Published: 19 March 2012

Abstract

In this article, the strict feasibility and solvability of generalized vector equilibrium problem with set-valued mapping in reflexive Banach spaces are considered. By introducing two generalized strict feasibility concepts for generalized vector equilibrium problem, we establish some sufficient conditions to guarantee that the solution set of the generalized vector equilibrium problem is nonempty and bounded provided that it is generalized strictly feasible.

MSC: 49K30; 90C29.

Keywords

generalized vector equilibrium problemnonemptiness and boundednessgeneralized strict feasibility

1 Introduction

Let X be a real reflexive Banach space and U be a metric space, and K ⊆ X, D ⊆ U be two nonempty and closed sets. Let T : K → 2 D be a nonempty-compact-valued mapping, i.e., T(x) is a nonempty compact subset for any x ∈ K, and upper semicontinuous on K. Let F : D × K × K → 2 Y be a set-valued map, where Y is a real normed space with an ordered cone C, that is, a proper, closed, and convex cone such that int C ≠ ∅.

The weak generalized vector equilibrium problem [1–4], abbreviated by WGVEP, is to find x ̄ ∈ K and ū ∈ T ( x ̄ ) such that
( WGVEP ) F ( ū , x ̄ , y ) ⊈ - int C , ∀ y ∈ K .
For the WGVEP, its dual problem is to find x ̄ ∈ K such that
( DWGVEP ) F ( v , y , x ̄ ) ⊈ int C , ∀ y ∈ K , v ∈ T ( y ) .

We denote the solution set of the WGVEP and the solution set of the DWGVEP by WS K and W S K D , respectively.

The strong generalized vector equilibrium problem [5, 6], abbreviated by SGVEP, is to find x ̄ ∈ K and ū ∈ T ( x ̄ ) such that
( SGVEP ) F ( ū , x ̄ , y ) ⋂ - int C = ∅ , ∀ y ∈ K .
For the SGVEP, its dual problem is to find x ̄ ∈ K such that
( DSGVEP ) F ( v , y , x ̄ ) ⋂ int C = ∅ , ∀ y ∈ K , v ∈ T ( y ) .
Similarly, we denote the solution set of the SGVEP and the solution set of the DWGVEP by SS K and S S K D , respectively. Obviously,
S S K ⊆ W S K

The generalized vector equilibrium problem finds applications in economics, finance, image reconstruction, ecology, transportation, network, and elasticity in [7]. In particular, when T(x) is singleton, i.e., T is a single-valued map, then the WGVEP collapse to the problem considered in [1–4], and the SGVEP collapse to the problem considered in [5, 6]. In this case, based on the coercivity assumption, the existence of solution for the generalized vector equilibrium problem are deeply discussed, see [1–13]. Recently, by virtue of the recession method, Ansari established some necessary and/or sufficient conditions for the nonemptiness and boundedness of the solution set for the SGVEP [5]. Later, Farajzadeh and Amini established some sufficient conditions for the compactness and convexity of the solution set of the SGVEP without the requirement of the lower semi-continuity of the map y → F(x, y) [6]. Lin derived some existence results for the generalized vector quasi-equilibrium problem under pseudomonotonicity and u-hemicontinuity/l-hemicontinuity [11]. Al-Homidan proposed existence results for generalized vector quasi-equilibrium problems by establishing some new fixed point theorems and maximal element theorems [12, 13]. Since the WGVEP and the SGVEP are the generalizations of the generalized vector equilibrium problem when T is a single-valued map, it is natural to ask whether the existence of the solution and duality for the WGVEP and the SGVEP can be derived for that T(x) is multivalued, which constitutes the motivation of this article.

Generally, the existence of solution for the classical vector equilibrium problem is established under the strict feasibility condition which was originally used in scalar variational inequality and vector variational inequality [14–17]. This technique can be extended to the scalar equilibrium problem [18]. On the other way, Hu and Fang extended the concept of strict feasibility to the classical vector equilibrium problem and established the nonemptyness and boundedness of the solution set of the C-pseudomonotone vector equilibrium problem if it is strictly feasible in the strong sense [19]. Motivated the study above, in this article, we first investigate the relations between solution set of the WGVEP (SGVEP) and solution set of the WDGVEP (SDGVEP) under the weakly (strongly) C-pseudomonotone condition. Furthermore, by introducing two new concepts for strictly feasible in the generalized sense to match the solvability of the WGVEP and the SGVEP, we establish some sufficient conditions to guarantee the nonemptyness and boundedness of the solution set for the generalized vector equilibrium problem if it is generalized strictly feasible. Our results generalize and extend some results of [18, 19] in some sense.

2 Notations and preliminaries

In this section, we recall some notations and preliminary results needed in the following sections. Let X, Y, K, D, C, T, F be same as in Section 1.

Definition 2.1 Let K ⊆ X be a nonempty, closed, and convex set.

(i) The mapping F : K → 2 Y is said to be C-convex if
α F ( x ) + ( 1 - α ) F ( y ) ⊆ F ( α x + ( 1 - α ) y ) + C , ∀ x , y ∈ K , α ∈ [ 0 , 1 ] .

(ii) The mapping F : K → 2 Y is said to be C-lower semicontinuous if the set {x ∈ K | F(x) - a ⊈ int C} is closed on K for any a ∈ Y. F is said to be weakly C-lower semicontinuous if F is C-lower semicontinuous with respect to the weak topology of X. The map F is said to be weakly lower semicontinuous on K if it is weakly lower semicontinuous on K.

(iii) The mapping F : D × K × K → 2 Y is said to be: weakly C-pseudomonotone if for all x, y ∈ K, u ∈ T (x), v ∈ T (y),

∃u ∈ T(x) such that F(u, x, y) ⊈ - int C ⇒ ∀v ∈ T(y) such that F(v, y, x) ⊈ int C, or equivalently,

∃v ∈ T(y) such that F(v, y, x) ⊈ int C ⇒ ∀u ∈ T(x) such that F(u, x, y) ⊆ - int C.

The mapping F : D × K × K → 2 Y is said to be: strongly C-pseudomonotone if for all x, y ∈ K, u ∈ T(x), v ∈ T(y),

∃u ∈ T(x) such that F(u, x, y) ⋂-int C = ∅ ⇒ ∀v ∈ T(y) such that F(v, y, x) ⋂ int C = ∅, or equivalently,

∃v ∈ T(y) such that F(v, y, x) ⋂ int C ≠ ∅ ⇒ ∀u ∈ T(x) such that F(u, x, y) ⋂-int C ≠ ∅,

(iv) The asymptotic cone K∞ and barrier cone barr(K) of K are, respectively, defined by
K ∞ = { d ∈ X | ∃ t k → + ∞ , ∃ x k ∈ K with x k t k ⇀ d }
and
barr ( K ) = { x * ∈ X * | sup x ∈ K 〈 x * , x 〉 < + ∞ } ,

where X* denotes the dual space of X and ⇀stands for the weak convergence.

Remark 2.1 (i) Definition 2.1 is a set-valued generalization of C-lower semicontinuity in [8]

(ii) If the map is strongly C-pseudomonotone, then it is weakly C-pseudomonotone. How-ever, the converse result is not true.

Example 2.1 Let X = R, K = [1, +∞), Y = R2, C = R + 2 , T(x) = {0, -1}.

Let F : D × K × K → 2 Y be defined by
F ( u , x , y ) = 〈 u , [ ( y - x ) , | y - x | ] 〉 ∀ x , y ∈ [ 1 , + ∞ ) , u ∈ T ( x ) [ 1 , 2 ] ∀ x , y ∈ [ 1 , + ∞ ) , u ∈ T ( x ) ,
∀x ∈ [1, + ∞), take u = 0 ∈ T(x), we have
F u , x , y = { 0 } × [1 , 2] ⊈ - int C .
Its dual problem is:
F ( v , y , x ) = 〈 v , [ ( x - y ) , | x - y | ] 〉 ∀ x , y ∈ [ 1 , + ∞ ) , v ∈ T ( y ) [ 1 , 2 ] ∀ x , y ∈ [ 1 , + ∞ ) , v ∈ T ( y ) .
∀x∈[1,+∞), if v = 0 ∈ T(y), we have
F ( v , y , x ) = { 0 } × [ 1 , 2 ] ⊈ int C ;
if v = -1 ∈ T(y), it holds
F ( v , y , x ) = [ - | x - y | , - ( x - y ) ] × [ 1 , 2 ] ⊈ int C .
It is easy to see
F ( v , y , x ) ⊈ int C , ∀ y ∈ [ 1 , + ∞ ) , v ∈ T ( y ) .

Hence F is weakly C-pseudomonotone. However, F is not strongly C-pseudomonotone.

The asymptotic cone K∞ has the following useful properties.

Lemma 2.1 [20] Let K ⊂ X be nonempty and closed. Then the following conclusions hold:

(i) K ∞ is closed cone;

(ii) If K is convex, then K∞ = {d ∈ X | K + d ⊂ K} = {d ∈ X | x + td ∈ K, ∀t > 0}, where x ∈ K is arbitrary point;

(iii) If K is convex cone, then K∞ = K.

Definition 2.2 The GVEP is said to be

(i) generalized strictly feasible in the weak sense if F w + ≠ ∅, where
F w + = x ∈ K | F ( u , x , x + y ) ⋂ int C ≠ ∅ , ∀ y ∈ K ∞ \ { 0 } , u ∈ T ( x ) ;
(ii) generalized strictly feasible in the strong sense if F s + ≠ ∅, where
F s + = { x ∈ K | F ( u , x , x + y ) ⊆ int C , ∀ y ∈ K ∞ \ { 0 } , u ∈ T ( x ) } .

Obviously, both F w +, F s + are equivalent to the F s + [19], when F is a single-valued map.

The following example is to explain that Definition 2.2 is applicable.

Example 2.2 Let X = R, K = [1, +∞), Y = R, C = R+, T (x) = {1}.

Let F1 : D × K × K → 2 Y be defined by
F 1 ( u , x , y ) = 〈 u , [ - ( y - x ) , y - x ] 〉 , ∀ x , y ∈ [ 1 , + ∞ ) , u ∈ T ( x ) .
It is verified that K∞ = [0, +∞). For any x ∈ [1, +∞) and t ∈ K∞\{0}, one has
F 1 ( u , x , x + t ) = 〈 1 , [ - t , t ] 〉 = [ - t , t ] ⋂ int C ≠ ∅ .

So, F w + = [1, +∞). However, F s + = ∅.

Let F2 : D × K × K → 2 Y be defined by
F 2 ( u , x , y ) = 〈 u , [ ( y - x ) , 2 ( y - x ) ] 〉 , ∀ x , y ∈ [ 1 , + ∞ ) , u ∈ T ( x ) .
It is verified that K∞ = [0, +∞). For any x ∈ [1, +∞) and t ∈ K∞\{0}, one has
F 2 ( u , x , x + t ) = 〈 1 , [ t , 2 t ] 〉 = [ t , 2 t ] ⊆ int C .

So, F w + = F s + = [ 1 , + ∞ ) .

Definition 2.3 [21] A set-valued map F : E → 2 X is said to be KKM mapping if, for each finite set Λ = {x1, . . ., x n } ⊆ E, one has co Λ ⊆ ⋃ i = 1 n F ( x i ) , where co(.) stands for the convex hull.

The main tools for proving our results are the following well-known KKM theorems.

Lemma 2.2 [22] Assume that X is a topological vector space, E ⊆ X is a nonempty convex and F : E → 2 X is a KKM mapping with closed values. If there is a subset X0 contained in a compact convex subset of E such that ⋂ x ∈ X 0 F ( x ) is compact, then ⋂x ∈ EF(x) ≠ ∅.

Definition 2.4 [23, 24] Let K be a nonempty, closed, and convex subset of a real reflexive Banach space X with its dual X*. We say that K is well-positioned iff there exist x0 ∈ X and g ∈ X* such that
〈 g , x - x 0 〉 ≥ | | x - x 0 | | , ∀ x ∈ K .

Lemma 2.3 [23, 24] Let K be a nonempty, closed, and convex subset of a real reflexive Banach space X with its dual X*. Then K is well-positioned if and only if the barrier cone barr(K) of K has a nonempty interior. Furthermore, if K is well-positioned then there is no sequence {x n } ⊆ K with ||x n || → +∞ such that origin is a weak limit of x n | | x n | | .

Lemma 2.4 [25] Let X and Y be two metric spaces and T : X → 2 Y be a nonempty-compact-valued mapping and upper semicontinuous at x*. Then, for any sequences x n → x* and u n ∈ T(x n ), there exist a subsequence { u n k } of {u n } and some u* ∈ T(x*) such that u n k → u * .

3 Solvability of the WGVEP and the SGVEP

First, we investigate relations between solution set of the WGVEP (SGVEP) and solution set of the DWGVEP (DSGVEP) when K is bounded.

Theorem 3.1 Let K ⊆ X be a nonempty and convex closed bounded set. If F : D × K × K → 2 Y satisfies the followings:

(i) F (u, x, x) ⊆ C, ∀x ∈ K, u ∈ T (x);

(ii) the set {(u, x), u ∈ T (x), x ∈ K : F (u, x, y) ⊈ -int C} is closed for any y ∈ K;

(iii) F is weakly C-pseudomonotone;

(iv) the set {y ∈ K | F(u, x, y) ⊈ int C} is closed and F (u, x, .) is C-convex for any x ∈ K, u ∈ T(x).

Then the WGVEP has a nonempty solution set and x* ∈ K is a solution of the WGVEP if and only if
F ( v , y , x * ) ⊈ int C , ∀ y ∈ K , v ∈ T ( y ) .
Proof. Set Γ: D × K → 2 K by
Γ ( v , y ) = { x ∈ K | F ( v , y , x ) ⊈ int C } , ∀ y ∈ K , v ∈ T ( y ) .
We claim that Γ is a KKM map. Suppose on the contrary, it does not hold, then there exists a finite set {x1, . . ., x n } ⊆ K and z ∈ co{x1, . . ., x n } such that z ∉ ⋃ i = 1 n Γ ( v , x i ) . Thus, there exists v i ∈ T(x i ) such that F(v i , x i , z) ⊆ int C, ∀i = 1, . . ., n. It follows from the weak C-pseudomonotonity of F that
F ( u , z , x i ) ⊆ - int C , ∀ i = 1 , … , n .
(3.1)
Taking into account that int C is convex, we obtain
t 1 F ( u , z , x 1 ) + … + t n F ( u , z , x n ) ⊂ - int C ,
where z = ∑ 1 n t i x i and ∑ 1 n t i = 1 , t i ≥ 0 , i = 1 , 2 , … , n . For the above t i , due to the convexity of F(u, x,.), one has
t 1 F ( u , z , x 1 ) + … t n F ( u , z , x n ) ⊆ F ( u , z , z ) + C ⊆ C + C ⊆ C ,

which contradicts (3.1). By the condition (iv), we derive that the Γ is closed valued. Hence Γ is a KKM map. By the KKM Theorem, there exists x*∈ K such that x* ∈ ⋂v ∈ T(y), y ∈ KΓ(v, y). That is, F (v, y, x*) ⊈ int C,∀y ∈ K, v ∈ T(y).

Let us verify W S K D ⊆ W S K . Take any x*∈ K, obviously
F ( v , y , x * ) ⊈ int C , ∀ y ∈ K , v ∈ T ( y ) .
(3.2)
For every y ∈ K, consider x t = x* + t(y - x*), ∀t ∈ (0, 1). Clearly, x t ∈ K. The C-convexity of F (u, x t ,.) implies that
( 1 - t ) F ( u , x t , x * ) + t F ( u , x t , y ) ⊆ F ( u , x t , x t ) + C ⊆ C + C ⊆ C .
Let us show tF (u, x t , y) ⊈-int C by contradiction. Suppose on the contrary, then tF (u, x t , y) ⊆ -int C. For any p ∈ tF (u, x t , y), it holds
( 1 - t ) F ( u , x t , x * ) ⊆ C + p ⊆ C + int C ⊆ int C .
So F (u, x t , x*) ⊆ int C, which contradicts (3.2). Noting that -int C is convex cone, we deduce
F ( u , x t , y ) ⊈ - int C .
(3.3)
Letting t → 0 in (3.3), we obtain by assumption (ii) and Lemma 2.4 that there exists u* ∈ T(x*) such that
F ( u * , x * , y ) ⊈ - int C , ∀ y ∈ K .

On the other hand, by the weak C-pseudomonotonity of F, we have W S K ⊆ W S K D .

Hence, W S K D = W S K .

Theorem 3.2 Let K ⊆ X be a nonempty and convex closed bounded set. If F : D × K × K → 2 Y satisfies the followings:

(i) F (u, x, x) ⊆ C,∀x ∈ K, u ∈ T(x);

(ii) the set {(u, x), u ∈ T(x), x ∈ K | F (u, x, y) ∩ -int C = ∅} is closed for all y ∈ K;

(iii) F is strongly C-pseudomonotone;

(iv) the set {y ∈ K | F (u, x, y) ∩ int C = ∅} is closed and F (u, x, .) is C-convex for any x ∈ K, u ∈ T(x).

Then the SGVEP has a nonempty solution set and x* ∈ K is a solution of the SGVEP if and only if
F ( v , y , x * ) ⋂ int C = ∅ , ∀ y ∈ K , v ∈ T ( y ) .
Proof. Set Γ: D × K → 2 K by
Γ ( v , y ) = { x ∈ K | F ( v , y , x ) ⋂ int C = ∅ } , ∀ y ∈ K , v ∈ T ( y ) .

Following the similar arguments in the proof of Theorem 3.1, we can obtain the desired result.

In following sequel, we shall present some sufficient conditions for the nonemptiness and boundedness of the solution set of the WGVEP provided that it is strictly feasible in the strong sense.

Theorem 3.3 Let K ⊆ X be a nonempty, closed, convex and well-positioned set. If F : D × K × K → 2 Y satisfies the followings:

(i) F (u, x, x) ⊆ C, ∀x ∈ K, u ∈ T(x);

(ii) the set {(u, x), u ∈ T (x), x ∈ K | F (u, x, y) ⊈-int C} is closed for any y ∈ K;

(iii) F is weakly C-pseudomonotone;

(iv) F (u, x, .) is C-convex and weakly lower semicontinuous for x ∈ K, u ∈ T(x).

Then the WGVEP has a nonempty bounded solution set whenever it is generalized strictly feasible in the strong sense.

Proof. Suppose that the WGVEP is generalized strictly feasible in the strong sense. Then there exists x0 ∈K such that x0 ∈ F s +, i.e.,
F ( u , x 0 , x 0 + z ) ⊆ int C , ∀ u ∈ T ( x 0 ) .
Set
D = { x ∈ K | F ( u , x 0 , x ) ⊈ int C } , ∀ u ∈ T ( x 0 ) .

By assumptions (i) and (iv), x0 ∈ D and D is weakly closed. We assert that D is bounded. Suppose on the contrary it does not holds, then there exists a sequence {x n } ⊆ M with ||x n || → +∞ as n → +∞. Since X is a reflexive Banach space, without loss of generality,

we may take a subsequence { x n k } of {x n } such that
1 | | x n k - x 0 | | ∈ ( 0 , 1 ) , lim k → + ∞ x n k - x 0 | | x n k - x 0 | | = lim k → + ∞ x n k | | x n k | | ⇀ z ∈ K ∞ .
By Lemma 2.3, z ≠ 0 since K is well-positioned. It follows from x0 ∈ F s + that
F ( u , x 0 , x 0 + z ) ⊆ int C .
(3.4)
Noting that F (u, x, .) is C-convex, we have
1 - 1 | | x n k - x 0 | | F ( u , x 0 , x 0 ) + 1 | | x n k - x 0 | | F ( u , x 0 , x n k ) ⊆ F u , x 0 , 1 - 1 | | x n k - x 0 | | x 0 + x n k | | x n k - x 0 | | + C = F u , x 0 , x 0 + x n k - x 0 | | x n k - x 0 | | + C .
That is,
1 | | x n - x 0 | | F ( u , x 0 , x n k ) ⊆ F u , x 0 , x 0 + x n k - x 0 | | x n k - x 0 | | + C .
We claim that F u , x 0 , x 0 + x n k - x 0 | | x n k - x 0 | | ⊈ int C . Suppose on the contrary, F u , x 0 , x 0 + x n k - x 0 | | x n k - x 0 | | ⊆ i n C , we observe
1 | | x n k - x 0 | | F ( u , x 0 , x n k ) ⊆ F u , x 0 , x 0 + x n k - x 0 | | x n k - x 0 | | + C ⊆ i n C + C ⊆ int C ,
which contradicts F ( u , x 0 , x n k ) ⊈ int C . Taking into account the condition (iv), we obtain
F ( u , x 0 , x 0 + z ) ⊈ int C .
This is a contradiction to (3.4). Thus, D is bounded and it is weakly compact. For each p ∈ K, set
D p = { x ∈ D | F ( v , p , x ) ⊈ int C } , ∀ p ∈ K , v ∈ T ( p ) .
Then D p ≠ ∅. Indeed, given p ∈ K, v ∈ T (p), set K0 = conv (D ⋃ p) ⊆ K, where conv means the convex hull of a set. Then K0 is nonempty, convex, and weakly compact. By Theorem 3.1, there exists x ̄ ∈ K 0 such that
F ( v , y , x ̄ ) ⊈ int C , ∀ y ∈ K 0 , v ∈ T ( p ) .

Then F ( u , x 0 , x ̄ ) ⊈ int C implies x ̄ ∈ D and F ( v , p , x ̄ ) ⊈ int C implies x ̄ ∈ D p . We obtain D p ≠ ∅. Obviously, D p is nonempty and weakly compact.

Next we prove that {D p | p ∈ K} has the finite intersection property. For any finite set {p i | i = 1, 2, . . ., n} ⊆ K, let K1 = conv{D ⋃ {p1, p2, . . ., p n }}. Then K1 is weakly compact. By Theorem 3.1, there exists x ^ ∈ K 1 such that
F ( v , y , x ^ ) ⊈ int C , ∀ y ∈ K 1 , v ∈ T ( p ) .
In particular, it holds
F ( u , x 0 , x ^ ) ⊈ int C , F ( v , p i , x ^ ) ⊈ int C , i = 1 , 2 , … , n .
This means that x ^ ∈ ⋂ i = 1 n D p i . Thus {D p | p ∈ K} has the finite intersection property. Since D is weakly compact and D p ⊆ D is weakly closed for all p ∈ K, v ∈ T (p), It follows that
⋂ p ∈ K D p ≠ ∅ .
Let x* ∈ ⋂p ∈ KD p It follows that
F ( v , y , x * ) ⊈ int C , ∀ y ∈ K , v ∈ T ( y ) .

By Theorem 3.1, x* is a solution of the WGVEP. As for the boundedness of the solution set of the WGVEP, it follows from Theorem 3.1 that the solution set of the WGVEP is a subset of D.

Theorem 3.4 Let K ⊆ X be a nonempty, closed, convex, and well-positioned set. If F : D × K × K → 2 Y satisfies the followings:

(i) F (u, x, x) ⊆ C, ∀x ∈ K, u ∈ T (x);

(ii) the set {(u, x), u ∈ T(x), x ∈ K | F(u, x, y) ⋂ - int C = ∅} is closed for all y ∈ K;

(iii) F is strongly C-pseudomonotone;

(iv) F (u, x, .) is C-convex and weakly lower semicontinuous for x ∈ K, u ∈ T(x);

(v) F is positively homogeneous with degree α > 0, i.e., there exists α > 0 such that
F ( u , x , x + t ( y - x ) ) = t α F ( u , x , y ) , ∀ x , y ∈ K , u ∈ T ( x ) , t ∈ ( 0 , 1 ) .

Then the SGVEP has a nonempty bounded solution set whenever it is generalized strictly feasible in the weak sense.

Proof. Suppose that the SGVEP is generalized strictly feasible in the weak sense. Then there exists x0 ∈ K such that x 0 ∈ F w + , i.e.,
F ( u , x 0 , x 0 + z ) ⋂ int C ≠ ∅ .
Set
D = { x ∈ K | F ( u , x 0 , x ) ⋂ int C = ∅ } .
By assumptions (i) and (iv), x0 ∈ D and D is weakly closed. We claim that D is bounded. Suppose on the contrary it does not holds, then there exists a sequence {x n } ⊆ M with ||x n || → +∞ as n → +∞. Since X is a reflexive Banach space, without loss of generality, we may take a subsequence { x n k } of {x n } such that
1 | | x n k | | ∈ ( 0 , 1 ) , lim n → + ∞ x n k | | x n k | | ⇀ z ∈ K ∞ .
By Lemma 2.3, z ≠ 0 since K is well-positioned. It follows from x0 ∈ F w + that
F ( u , x 0 , x 0 + z ) ⋂ int C ≠ ∅ .
(3.5)
Since x n k ∈ D and F is positively homogenous with degree α > 0, it holds
F u , x 0 , x 0 + x n k - x 0 | | x n k | | = 1 | | x n k | | α F ( u , x 0 , x n k ) ⋂ int C = ∅ .
Taking into account the condition (iv), we obtain
F ( u , x 0 , x 0 + z ) ⋂ int C = ∅ .

This is a contradiction to (3.5). Thus, D is bounded and it is weakly compact. Following the similar arguments in the proof of Theorem 3.3, we can prove the Theorem 3.4.

Remark 3.1 Assumption (v) of Theorem 3.4 is not new. Clearly, if F(x, y) = 〈u, y -x〉, ∀u ∈ T(x), then F is positively homogeneous with degree = 1.

Remark 3.2 Since SS K ⊆ WS K , conditions for the solution set of the SGVEP to be nonempty and bounded are stronger than the WGVEP. Compared with Theorem 3.3, the condition that F is positively homogeneous in Theorem 3.4 is not dropped for the SGVEP.

The following example shows that the converse of Theorem 3.3 or 3.4 is not true in general.

Example 3.1 Let X = R, K = R, D = [0, 1], Y = R, C = R + 2 and
T ( x ) = { 1 } , i f x > 0 { 0 , 1 } , i f x = 0 .
Let F : D × K × K → 2 Y be defined by
F ( u , x , y ) = u , ( y 2 - x 2 ) 2 , ( y 2 - x 2 ) ∀ x , y ∈ K , u ∈ T ( x ) ; 〈 u , ( y - x ) 〉 ∀ x , y ∈ K .

It is easily to see that K is well-positioned and F satisfies assumptions of Theorems 3.3 and 3.4. It can be verified that the WGVEP and the SGVEP have the same solution set {0}. On the other hand, it is easy to verify that F w + = F s + = ∅ .

For general generalized vector equilibrium problem, the following example shows WS K ≠ ∅, but SS K = ∅.

Example 3.2 Let X = R, K = R, D = [-1, 1], Y = R, C = R+ and
T ( x ) = { - 1 , 1 } , ∀ x ∈ K F ( u , x , y ) = [ - 1 , 1 ] , ∀ x , y ∈ K , u ∈ T ( x ) .

It is obvious that the WGVEP has solution set WS K = R, but solution set of the SGVEP SS K = ∅.

Declarations

Acknowledgements

This research was supported by the Natural Science Foundation of China (Grant Nos.11171180, 71101081 and Tianyuan fund for Mathematics, No. 11126233), and Specialized Research Fund for the doctoral Program of Chinese Higher Education (Grant Nos. 20113705120004, 20113705110002). The authors are in debt to the anonymous referees for their numerous insightful comments and constructive suggestions which help improve the presentation of the article.

Authors’ Affiliations

(1)
School of Management Science, Qufu Normal University, Shandong Rizhao, China
(2)
School of Mathematics and Information Science, Weifang University, Shandong Weifang, China

References

  1. Konnov IV, Yao JC: Existence of solutions for generalized vector equilibrium problems. J Math Anal Appl 1999, 233: 328–335. 10.1006/jmaa.1999.6312MathSciNetView ArticleGoogle Scholar
  2. Ansari QH, Yao JC: An existence result for the generalized vector equilibrium problems. Appl Math Lett 1999, 12(8):53–56. 10.1016/S0893-9659(99)00121-4MathSciNetView ArticleGoogle Scholar
  3. Ansari QH, Konnov IV, Yao JC: On generalized vector equilibrium problems. Nonlinear Anal 2001, 47: 543–554. 10.1016/S0362-546X(01)00199-7MathSciNetView ArticleGoogle Scholar
  4. Ansari QH, Siddiqi AH, Wu SY: Existence and duality of generalized vector equilibrium problems. J Math Anal Appl 2001, 259: 115–126. 10.1006/jmaa.2000.7397MathSciNetView ArticleGoogle Scholar
  5. Ansari QH, Flores-Bazán F: Recession methods for generalized vector equilibrium problems. J Math Anal Appl 2006, 321: 132–146. 10.1016/j.jmaa.2005.07.059MathSciNetView ArticleGoogle Scholar
  6. Farajzadeh AP, Harandi AA: On the generalized vector equilibrium problems. J Math Anal Appl 2008, 344: 999–1004. 10.1016/j.jmaa.2008.02.065MathSciNetView ArticleGoogle Scholar
  7. Gianness F: Vector Variational Inequalities and Vector Equilibria. In Mathematical Theories, 38 of Nonconvex Optimization and Its Applications. Kluwer, The Nether-lands; 2000.Google Scholar
  8. Bianchi M, Hadjisavvas N, Schaible S: Vector equilibrium problems with generalized monotone bifunctions. J Optim Theory Appl 1997, 92(3):527–542. 10.1023/A:1022603406244MathSciNetView ArticleGoogle Scholar
  9. Hadjisavvas N, Schaible S: From scalar to vector equilibrium problems in the quasi-monotone case. J Optim Theory Appl 1998, 96: 297–309. 10.1023/A:1022666014055MathSciNetView ArticleGoogle Scholar
  10. Ansari QH, Konnov IV, Yao JC: Characterizations of solutions for vector equilibrium problems. J Optim Theory Appl 2002, 113(3):435–447. 10.1023/A:1015366419163MathSciNetView ArticleGoogle Scholar
  11. Lin LJ, Huang YJ, Ansari QH: Some existence results for solutions of generalized vector quasi-equilibrium problems. Math Meth Oper Res 2007, 65: 85–98. 10.1007/s00186-006-0102-4MathSciNetView ArticleGoogle Scholar
  12. Al-Homidan S, Ansari QH: Fixed point theorems on product topological semilattice spaces, generalized abstract economies and systems of generalized vector quasi-equilibrium problems. Taiwanese J Math 2011, 15(1):307–330.MathSciNetGoogle Scholar
  13. Al-Homidan S, Ansari QH, Yao JC: Collectively fixed point and maximal element theorems in topological semilattice spaces. Applicable Anal 2011, 96(6):865–888.MathSciNetView ArticleGoogle Scholar
  14. He YR, Ng KF: Strict feasibility of generalized complementarity problems. J Austral Math Soc Ser A 2006, 81(1):15–20. 10.1017/S1446788700014609MathSciNetView ArticleGoogle Scholar
  15. He YR, Mao XZ, Zhou M: Strict feasibility of variational inequalities in reflexive Banach spaces. Acta Math Sin 2007, 23: 563–570.MathSciNetView ArticleGoogle Scholar
  16. Fang YP, Huang NJ: Feasibility and solvability for vector complementarity problems. J Optim Theory Appl 2006, 129(3):373–390. 10.1007/s10957-006-9073-0MathSciNetView ArticleGoogle Scholar
  17. Fang YP, Huang NJ: Feasibility and solvability of vector variational inequalities with moving cones in Banach spaces. Nonlinear Anal 2009, 47: 2024–2034.MathSciNetView ArticleGoogle Scholar
  18. Hu R, Fang YP: Feasibility-solvability theorem for a generalized system. J Optim Theory Appl 2009, 142(3):493–499. 10.1007/s10957-009-9510-yMathSciNetView ArticleGoogle Scholar
  19. Hu R, Fang YP: Strict feasibility and solvability for vector equilibrium problems in reflexive Banach spaces. Optim Lett 2011, 5: 505–514. 10.1007/s11590-010-0215-9MathSciNetView ArticleGoogle Scholar
  20. Auslender A, Teboulle M: Asymptotic Cones and Functions in Optimization and-Variational Inequalities. Springer, New York; 2003.Google Scholar
  21. Fan K: Some properties of sets related to fixed point theorems. Math Ann 1984, 266: 519–537. 10.1007/BF01458545MathSciNetView ArticleGoogle Scholar
  22. Tarafdar E: A fixed point theorem quivalent to the Fan-Knaster-Kuratowski-Mazurkiewcz theorem. J Math Anal Appl 1987, 128: 475–479. 10.1016/0022-247X(87)90198-3MathSciNetView ArticleGoogle Scholar
  23. Adly S, Ernst E, Théra M: On the closedness of the algebraic difference of closed convex sets. J Math Pures Appl 2003, 82(9):1219–1249. 10.1016/S0021-7824(03)00024-2MathSciNetView ArticleGoogle Scholar
  24. Adly S, Ernst E, Théra M: Well-positioned closed convex sets and well-positioned closed convexfunctions. J Global Optim 2004, 29: 337–351.MathSciNetView ArticleGoogle Scholar
  25. Wang G, Huang XX, Zhang J, Chen GY: Levitin-Polyak weii-posedness of generalized vector equilibrium problems with functional constraints. Acta Math Sci 2010, 30: 1400–1412.MathSciNetView ArticleGoogle Scholar

Copyright

© Wang and Che; 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