Next Article in Journal
High Persistence and Nonlinear Behavior in Financial Variables: A More Powerful Unit Root Testing in the ESTAR Framework
Next Article in Special Issue
Outer Approximation Method for the Unit Commitment Problem with Wind Curtailment and Pollutant Emission
Previous Article in Journal
Identifying Influential Edges by Node Influence Distribution and Dissimilarity Strategy
Previous Article in Special Issue
Dynamic Model of Contingency Flight Crew Planning Extending to Crew Formation
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Arcwise Connectedness of the Solution Sets for Generalized Vector Equilibrium Problems

1
College of Science and Technology, Nanchang University, Gongqingcheng 332020, China
2
Department of Mathematics, Nanchang University, Nanchang 330031, China
*
Author to whom correspondence should be addressed.
Mathematics 2021, 9(20), 2532; https://doi.org/10.3390/math9202532
Submission received: 7 September 2021 / Revised: 29 September 2021 / Accepted: 1 October 2021 / Published: 9 October 2021
(This article belongs to the Special Issue Optimization Theory and Applications)

Abstract

:
In this research, by means of the scalarization method, arcwise connectedness results were established for the sets of globally efficient solutions, weakly efficient solutions, Henig efficient solutions and superefficient solutions for the generalized vector equilibrium problem under suitable assumptions of natural quasi cone-convexity and natural quasi cone-concavity.

1. Introduction

Let K be a nonempty subset of a Banach space X. Let Y be a normed vector space and F : X × X 2 Y be a multi-valued mapping. We consider the following generalized vector equilibrium problem (GVEP): find x ¯ K , such that
F x ¯ , y Ω = , y K ,
where Ω 0 is a convex cone in Y. (GVEP) can provide a unifying framework for dealing with an astonishing variety of problems, such as vector variational inequality, vector optimization, the vector complementary problem, the Nash equilibrium problem, the saddle point problem and fixed point problem, etc. (see, e.g., [1,2,3,4]).
For the (generalized) vector equilibrium problem, the study of connectedness about its solution sets has been paid close attention by many authors. One important reason is that it guarantees the possibility of continuous variation from one solution to another. Up to now, a large quantity of meaningful results have been given in the literature (see, e.g., [5,6,7,8,9,10,11,12,13,14]). By applying the scalarization technique, Gong [6] discussed the connectedness of the sets of Henig efficient solutions and weakly efficient solutions for vector equilibrium problems in normed spaces. In [7], Gong proposed various kinds of notions of efficient solutions to the vector equilibrium problem and gave many characterizations in the way of scalarization. With the help of these characterizations, he further proved several theorems about connectedness for these efficient solution sets. In [8], by using a different method of density, Gong and Yao discussed the connectedness of the efficient solution set for Ky Fan inequalities with monotone mappings. Later, Han and Huang [9] extended the density method used in [8] to investigate the connectedness of the efficient solution set for the generalized vector quasi-equilibrium problem. Chen et al. [10] investigated the connectedness of the sets of ε -weakly efficient solutions and ε -efficient solutions for vector equilibrium problems. In 2016, without the assumptions of monotonicity and compactness, Han and Huang [11] obtained some results concerning the connectedness for many different kinds of efficient solution sets of (GVEP). Recently, by using a new nonconvex separation theorem, Xu and Zhang [12] established the connectedness and the path connectedness results for the solution set of the strong vector equilibrium problem. By virtue of a density result, Peng et al. [13] proved some connectedness theorems for the set of approximate efficient points and the set of approximate efficient solutions to generalized semi-infinite vector optimization problems. Peng et al. [14] also considered the connectedness and path-connectedness of the solution sets for weak generalized symmetric Ky Fan inequality problems with respect to the addition-invariant set. Very recently, Shao et al. [15] did some research on the connectedness of solution sets for generalized vector equilibrium problems via free-disposal sets. However, as far as we know, there has been no paper dealing with the arcwise connectedness for various solution sets of (GVEP) until now.
The main aim of this paper is to give some new findings about arcwise connectedness for various kinds of efficient solution sets of (GVEP) under suitable assumptions of natural quasi cone-convexity and natural quasi cone-concavity. For this, we shall present some necessary definitions and known lemmas in Section 2. Then, in Section 3, we give some results of nonemptyness, closedness, and convexity for the f-efficient solution set of (GVEP). Furthermore, we prove a conclusion of lower semicontinuity in regard to the f-efficient solution mapping. All of this helps us finally to establish the arcwise connectedness of the efficient solution sets for (GVEP). Additionally, examples are given to illustrate our main results of arcwise connectedness.

2. Preliminaries

From now on, unless stated otherwise, we always suppose that X is a Banach space and Y is a normed vector space with its topological dual Y * . Let K be a nonempty subset in X and C be a closed, convex and pointed cone in Y. Let F : X × X 2 Y be a multi-valued mapping. Denote by R + the set of all non-negative numbers, i.e., R + = { x R : x 0 } . The dual cone of C is defined by
C * = f Y * : f c 0 , c C .
Moreover, the quasi-interior of C * is defined as follows:
C # = f Y * : f c > 0 , c C \ 0 .
We denote by int D , cl ( D ) , cone ( D ) and co ( D ) the interior, closure, cone hull and convex hull of a nonempty subset D, respectively. Let B be a nonempty convex subset of the convex cone C. We note that B is a base of C if C = cone B and 0 cl B . Clearly, C # if and only if C has a base.
Take a base B for the convex cone C and let it be fixed. Define
C Δ = f C # : there exists t > 0 such that f b t , for all b B .
Obviously, C Δ C # . Furthermore, we can conclude from the separation theorem of convex sets that C Δ . On the other hand, noting that 0 cl ( B ) , we can take
δ = sup t > 0 : t U Y B =
and let V B = 1 2 δ U Y , where U Y stands for the open unit ball in Y. Then, it is easy to see that V B is an open convex neighborhood of 0 in Y. For each convex neighborhood U of 0 in Y with U V B , we can check that the set B + U is convex and 0 cl B + U . Hence, C U ( B ) = cone B + U is a convex pointed cone satisfying C \ { 0 } int C U ( B ) .
In this research, we denote by W K , F the weakly efficient solution set for (GVEP), that is,
W K , F = x K : F x , y int C = , y K .
In addition, we denote by E K , F the efficient solution set for (GVEP), that is,
E K , F = x K : F x , y C \ 0 = , y K .
Definition 1.
For (GVEP), we call a vector x K
(i)
a globally efficient solution if there exists a convex pointed cone P in Y with C \ { 0 } int P , such that
F x , y P \ 0 = , for   all y K .
Let G K , F be the set composed of all globally efficient solutions;
(ii)
a Henig efficient solution if there exists a neighborhood U of 0 with U V B , such that
F ( x , y ) ( int C U ( B ) ) = , for   all y K .
Let H ( K , F ) be the set composed of all Henig efficient solutions;
(iii)
a superefficient solution if for any neighborhood V of 0, there exists a neighborhood U of 0, such that
cone ( F ( x , K ) ) ( U C ) V .
Let S ( K , F ) be the set composed of all superefficient solutions.
Given arbitrary f C * \ { 0 } , let
Q ( f ) = { x K : f ( F ( x , y ) ) R + , f o r a l l y K } .
We call Q f the f-efficient solution set of (GVEP).
Definition 2.
Let D be a nonempty subset in X. A multi-valued mapping M : X 2 Y is called
(i)
([4]) C-convex on D if x 1 , x 2 D , t 0 , 1 , one has
t M ( x 1 ) + ( 1 t ) M ( x 2 ) M ( t x 1 + ( 1 t ) x 2 ) + C ;
(ii)
([16]) properly quasi C-convex on D if x 1 , x 2 D , t [ 0 , 1 ] , one has
e i t h e r M ( x 1 ) M ( t x 1 + ( 1 t ) x 2 ) + C , o r M ( x 2 ) M ( t x 1 + ( 1 t ) x 2 ) + C ;
(iii)
natural quasi C-convex on D if x 1 , x 2 D , t [ 0 , 1 ] , there exists γ [ 0 , 1 ] , such that
γ M ( x 1 ) + ( 1 γ ) M ( x 2 ) M ( t x 1 + ( 1 t ) x 2 ) + C ;
(iv)
natural quasi C-concave on D if x 1 , x 2 D , t [ 0 , 1 ] , there exists γ [ 0 , 1 ] , such that
M ( t x 1 + ( 1 t ) x 2 ) γ M ( x 1 ) + ( 1 γ ) M ( x 2 ) + C ;
(v)
strictly natural quasi C-concave on D if x 1 , x 2 D ( x 1 x 2 ) , t ( 0 , 1 ) , there exists γ [ 0 , 1 ] , such that
M ( t x 1 + ( 1 t ) x 2 ) γ M ( x 1 ) + ( 1 γ ) M ( x 2 ) + int C .
Remark 1.
Obviously, strictly natural quasi C-concavity implies natural quasi C-concavity.
Remark 2.
If M is C-convex or properly quasi C-convex, then it must be natural quasi C-convex. However, the converse is not true in general as shown by the following example.
Example 1.
Let X = R , Y = R 2 , D = [ 0 , π 2 ] and C = { ( x 1 , x 2 ) R 2 : x 1 , x 2 0 } . Define a multi-valued mapping M : X 2 Y as follows: for each x X ,
M x = sin x , 1 sin x + B Y ,
where B Y denotes the closed unit ball in Y. It is easy to verify that M is natural quasi C-convex on D. However, it is neither C-convex nor properly quasi C-convex on D.
The next example indicates that the strictly natural quasi C-concavity can be satisfied easily.
Example 2.
Let X = R , Y = R 2 , D = [ 1 , 1 ] and C = { ( x 1 , x 2 ) R 2 : x 1 , x 2 0 } . Define a multi-valued mapping M : X 2 Y as follows: for each x X ,
M x = x 2 + 1 , 2 cos x + B Y ,
where B Y presents the closed unit ball in Y. Notice that the two functions x 2 + 1 and cos x are both strictly concave. Then, we can conclude easily that M has strictly natural quasi C-concavity on D.
Definition 3.
Let E be a linear space and D E be a nonempty subset. A multi-valued mapping T : D 2 E is called a KKM mapping if for any finite subset x 1 , x 2 , , x n in D, one has
co x 1 , x 2 , , x n i = 1 n T x i .
Lemma 2.
(Fan-KKM Theorem) Let E be a Hausdorff topological vector space and D E be a nonempty subset. Assume that T : D 2 E is a KKM mapping. If for any x D , T ( x ) is closed, and for at least one point x D , T ( x ) is compact, then x D T ( x ) .
Definition 4.
Let E and Z be two topological spaces. A multi-valued mapping Φ : E 2 Z is called
(i)
upper semicontinuous (u.s.c.) at x E if for any open set V in Z with Φ ( x ) V , there exists a neighborhood U of x, such that Φ ( x ) V for every x U ;
(ii)
lower semicontinuous (l.s.c.) at x E if for any open set V in Z with Φ ( x ) V , there exists a neighborhood U of x, such that Φ ( x ) V for every x U ;
(iii)
u.s.c. (resp. l.s.c.) on E if it is u.s.c. (resp. l.s.c.) at each point x E ;
(iv)
continuous on E if it is both u.s.c. and l.s.c. on E.
Lemma 2.
Let E and Z be two topological spaces and Φ : E 2 Z be a multi-valued mapping. Given a point x E :
(i)
([17]) Φ is l.s.c. at x if and only if for each y Φ x and for each net x α in E with x α x , there exists a net { y α } with y α Φ x α , such that y α y ;
(ii)
([4]) If Φ x is compact, then Φ is u.s.c. at x if and only if for each net { x α } in E with x α x and for each net { y β } with y α Φ x α , there exist y Φ ( x ) and a subnet { y β } of { y α } , such that y β y .
The following lemma is of great importance for us to establish our main results.
Lemma 2.
([18]) Let E be a paracompact Hausdorff arcwise connected space and Z be a Banach space. Assume that T : E 2 Z is a multi-valued mapping, such that for any x E , T ( x ) is nonempty, closed and convex. If T is l.s.c. on E, then T ( E ) = x E T ( x ) is arcwise connected.
The next lemma gives scalar characterizations for the solution sets G ( K , F ) , H ( K , F ) , W ( K , F ) and S ( K , F ) , which is similar to Theorem 2.1 of [7].
Lemma 4.
([11]) Assume that for each x K , the set F x , K + C is convex. If C has a nonempty interior, i.e., int C , then
(i)
W K , F = f C * \ 0 Q f .
If C has a base B, then
(ii)
G K , F = f C # Q f ;
(iii)
H K , F = f C Δ Q f .
Moreover, if C has a bounded base, then
(iv)
S K , F = f int C * Q f .
Remark 3.
It is easy to see that all the sets C * \ 0 , C Δ , C # and int C * are convex. As a consequence, they are all arcwise connected.

3. Arcwise Connectedness

In this section, with the help of natural quasi cone-convexity and natural quasi cone-concavity, we shall establish arcwise connectedness results for various kinds of efficient solution sets of (GVEP).
Lemma 5.
Let K X be a nonempty, compact and convex subset. Suppose that
(i)
for every x K , F x , x C ;
(ii)
for any y K , the mapping F · , y is l.s.c. on K;
(iii)
for any x K , the mapping F x , · is natural quasi C-convex on K.
Then, for each f C * \ { 0 } , the f-efficient solution set Q ( f ) of (GVEP) is nonempty.
Proof. 
Take any f C * \ { 0 } and let it be fixed. Define a multi-valued mapping T : K 2 K as follows:
T y = x K : f F x , y R + , y K .
For any given y K , we have T y as y T y . Furthermore, we can prove that T y is closed. In fact, let { u n } be any sequence in T ( y ) such that u n u 0 X . Then, u 0 K since K is closed. Furthermore, by the lower semicontinuity of F ( · , y ) and Lemma 2, we have that for any w F ( u 0 , y ) , there exists w n F ( u n , y ) , such that w n w . It follows that f ( w n ) f ( w ) . Noting that f w n R + , we can obtain f w R + . By the arbitrariness of w, we obtain f ( F ( u 0 , y ) ) R + . Hence, u 0 T y , which indicates that T y is closed. Moreover, T y is compact, as K is compact.
Next, we shall prove that T is a KKM mapping. In fact, suppose by contradiction that there exist y 1 , y 2 , , y n K and some y 0 co ( { y 1 , y 2 , , y n } ) , such that y 0 T y i , i = 1 , 2 , , n . As K is convex, we know that y 0 K . Hence, for any i { 1 , 2 , , n } , there must exist some w i F ( y 0 , y i ) , such that f ( w i ) < 0 . As y 0 co y 1 , , y n , there exist real numbers λ 1 , λ 2 , , λ n 0 with i = 1 n λ i = 1 , such that y 0 = i = 1 n λ i y i . Then, by the natural quasi C-convexity of F y 0 , · , there exist real numbers t i 0 , i = 1 , 2 , , n with i = 1 n t i = 1 , such that
t = 1 n t i F y 0 , y i F ( y 0 , i = 1 n λ i y i ) + C = F y 0 , y 0 + C C + C = C .
From this, we can obtain i = 1 n t i w i C . As f C * \ { 0 } , we have
0 f ( i = 1 n t i w i ) = i = 1 n t i f ( w i ) < 0 .
This is impossible. So T is a KKM mapping.
Therefore, by applying the Fan-KKM theorem, we can obtain y K T y . This means Q f . □
Lemma 6.
Let K X be a nonempty convex subset. Suppose that for each y K , F · , y is natural quasi C-concave on K. Then, for any f C * \ { 0 } , the f-efficient solution set Q ( f ) of (GVEP) is convex.
Proof. 
Let f C * \ { 0 } and x 1 , x 2 Q f . For any t 0 , 1 , set x t = t x 1 + ( 1 t ) x 2 . Then x t K as K is convex. Moreover, for each i { 1 , 2 } ,
f ( F ( x i , y ) ) R + , y K .
By the natural quasi C-concavity of F · , y , there exists some λ 0 , 1 , such that
F ( x t , y ) λ F ( x 1 , y ) + ( 1 λ ) F ( x 2 , y ) + C .
Notice that f C * \ { 0 } . Then, by (1) and (2), we can obtain
f ( F ( x t , y ) ) λ f ( F ( x 1 , y ) ) + ( 1 λ ) f ( F ( x 2 , y ) ) + f ( C ) R + .
It follows that x t Q ( f ) . Thus, Q ( f ) is convex. □
Lemma 7.
Let K X be a nonempty closed subset. Let f C * \ { 0 } be given. If for every y K , F ( · , y ) is l.s.c. on K, then the f-efficient solution set Q ( f ) of (GVEP) is closed.
Proof. 
Let { x n } be any sequence in Q ( f ) , such that x n x 0 X . Then x n K and
f F x n , y R + , y K .
By the closedness of K, we have x 0 K . For any given y K , by the lower semicontinuity of F ( · , y ) and Lemma 2, we know that for each z F ( x 0 , y ) , there exists z n F x n , y , such that z n z . Then, f z n 0 and f z n f z . It follows that f ( z ) 0 . As z is arbitrary, we can obtain f ( F ( x 0 , y ) ) R + . Furthermore, since y is also arbitrary, we obtain x 0 Q f . This implies that Q ( f ) is closed. □
Lemma 8.
Let K X be a nonempty, convex and compact subset. Suppose that the following conditions hold:
(i)
for every x K , F ( x , x ) C ;
(ii)
for each y K , the mapping F ( · , y ) is strictly natural quasi C-concave on K;
(iii)
for each x K , the mapping F ( x , · ) is natural quasi C-convex on K;
(iv)
F ( · , · ) is continuous on K × K with nonempty compact values.
Then, the f-efficient solution mapping Q ( · ) is l.s.c. on C * \ { 0 } , where the space C * \ { 0 } is endowed with the normed topology.
Proof. 
Take arbitrary f 0 C * \ { 0 } and let it be fixed. We only need to show that Q ( · ) is l.s.c. at f 0 . Indeed, suppose to the contrary that Q ( · ) is not l.s.c. at f 0 . Then, there exist x 0 Q ( f 0 ) and a neighborhood W 0 of 0 in X, such that for any neighborhood U f 0 of f 0 , there exists f U f 0 satisfying ( x 0 + W 0 ) Q ( f ) = . This indicates that there exists a sequence f n with f n f 0 , such that
( x 0 + W 0 ) Q ( f n ) = , n N + .
We consider two cases:
Case 1. Q ( f 0 ) is singleton. For each n, by Lemma 5, we know that Q ( f n ) . Take arbitrary x n Q ( f n ) K . By the compactness of K, we may assume that x n x ¯ K . We assert x ¯ Q f 0 . Indeed, suppose by contradiction that x ¯ Q ( f 0 ) . Then, there must exist y ¯ K and some z ¯ F x ¯ , y ¯ , such that f 0 ( z ¯ ) < 0 . By the lower semicontinuity of F ( · , · ) and Lemma 2, we know that there exists a sequence { z n } in Y such that z n F ( x n , y ¯ ) and z n z ¯ . Since f n f 0 , we derive f n z n f 0 z ¯ . Then, by the fact that f 0 ( z ¯ ) < 0 , we can obtain f n z n < 0 for n large enough, which contradicts x n Q ( f n ) . Therefore, x ¯ Q f 0 . Since Q f 0 is singleton, we know x ¯ = x 0 and so x n x 0 . It follows that x n x 0 + W 0 for a large enough n. Hence, x n x 0 + W 0 Q f n for a large enough n, which is a contradiction to (3).
Case 2. Q ( f 0 ) is not singleton. Then, it has at least two elements. Take arbitrary x Q ( f 0 ) satisfying x x 0 . For any given y K , since x , x 0 Q ( f 0 ) , we have x , x 0 K and
f 0 F x 0 , y R + and f 0 F x , y R + .
For each t 0 , 1 , by the strictly natural quasi C-concavity of F ( · , y ) , there exists λ 0 , 1 satisfying
F t x + 1 t x 0 , y λ F x , y + 1 λ F x 0 , y + int C .
As f 0 C * \ 0 , we can obtain
f 0 F t x + 1 t x 0 , y λ f 0 F x , y + 1 λ f 0 F x 0 , y + f 0 int C R + 0 ,
where R + 0 : = x R : x > 0 . For each t 0 , 1 , we set x t = t x + 1 t x 0 . Then, x ( t ) K and x ( t ) x 0 as t 0 . Thus, there exists t 0 0 , 1 such that x t 0 x 0 + W 0 . This, together with (3), indicates that x t 0 Q f n for every n N + . It follows that for every n, there exists y n K and some z n F ( x ( t 0 ) , y n ) , such that f n z n < 0 . Since K is compact, without loss of generality, we may assume y n y K . Then, by the upper semicontinuity of F ( · , · ) and Lemma 2, { z n } has a subsequence converging to some point z F ( x ( t 0 ) , y ) . Without loss of generality, we may assume z n z . Noting that f n f 0 , we conclude f n z n f 0 z . Then, by the fact f n z n < 0 , we can obtain f 0 ( z ) 0 , which contradicts (4). □
Theorem 1.
Suppose that all the assumptions in Lemma 8 are satisfied. If for each x K , the set F ( x , K ) + C is convex and int C , then the weakly efficient solution set W ( K , F ) is arcwise connected.
Proof. 
It is clear that C * \ { 0 } is a metric space (the metric is induced by the norm in Y * ). Then, C * \ { 0 } is paracompact. By Remark 3, we know that C * \ { 0 } is also arcwise connected. Furthermore, by Lemma 4, we have W ( K , F ) = f C * \ { 0 } Q ( f ) . By Lemmas 5–7, we know that for each f C * \ { 0 } , Q f is nonempty, convex and closed. In addition, by Lemma 8, we understand that Q ( · ) is still l.s.c. on C * \ { 0 } , where C * \ { 0 } is endowed with the normed topology. Hence, we conclude from Lemma 3 that W ( K , F ) is arcwise connected. □
Theorem 2.
Suppose that all the assumptions in Lemma 8 are satisfied. If for each x K , the set F ( x , K ) + C is convex and C has a base B, then the globally efficient solution set G ( K , F ) and the Henig efficient solution set H ( K , F ) are both arcwise connected.
Proof. 
By Lemma 4, we have G ( K , F ) = f C # Q ( f ) and H ( K , F ) = f C Δ Q ( f ) . Then, by proceeding with the argument in the proof of Theorem 1, we can derive the conclusions. □
Theorem 3.
Suppose that all the assumptions in Lemma 8 are satisfied. If for each x K , the set F x , K + C is convex and C has a bounded base, then the superefficient solution set S ( K , F ) is arcwise connected.
Proof. 
Notice that S ( K , F ) = f int C * Q ( f ) . Then, the conclusion can be proved with the argument in the proof of Theorem 1. □
Finally, we give two examples to illustrate our main results of arcwise connectedness.
Example 3.
Let X = R , Y = R 2 , K = [ 1 , 1 ] and C = { ( x 1 , x 2 ) R 2 : x 1 , x 2 0 } . Let F : X × X 2 Y be defined as follows: for each ( x , y ) X × X ,
F ( x , y ) = ( f 1 ( x , y ) , f 2 ( x , y ) ) + B Y ,
where
f 1 ( x , y ) = x 2 + y 2 + 1 , f 2 ( x , y ) = cos ( 1 2 x ) + y + 2 .
Clearly, for each y K , the two functions f 1 ( · , y ) and f 2 ( · , y ) are both strictly concave on K. Then, we can conclude that the multi-valued mapping F ( · , y ) is strictly natural quasi C-concave on K. Similarly, it is clear that for each x K , the two functions f 1 ( x , · ) and f 2 ( x , · ) are both convex on K. Then, we can derive that the multi-valued mapping F ( x , · ) is C-convex on K. From this, we can verify easily that the set F x , K + C is convex, and the mapping F ( x , · ) is natural quasi C-convex on K. The other conditions of Theorems 1–3 can be checked easily. Thus, by Theorems 1–3, we know that all the solution sets G ( K , F ) , H ( K , F ) , W ( K , F ) and S ( K , F ) are arcwise connected. In fact, by applying Lemma 4, we can calculate G ( K , F ) = H ( K , F ) = W ( K , F ) = S ( K , F ) = [ 1 , 1 ] . Clearly, these sets are all convex. As a consequence, they are arcwise connected.
Example 4.
Let X = R , Y = R 2 , K = [ 0 , π 2 ] and C = { ( x 1 , x 2 ) R 2 : x 1 , x 2 0 } . Let F : X × X 2 Y be defined as follows: for each ( x , y ) X × X ,
F ( x , y ) = ( f 1 ( x , y ) , f 2 ( x , y ) ) + B Y ,
where
f 1 ( x , y ) = sin ( x ) + y 2 + 1 , f 2 ( x , y ) = x 2 + x y + 1 .
Then, by a similar argument as that of Example 3, we can verify that all the conditions of Theorems 1–3 are satisfied. Thus, we conclude from Theorems 1–3 that all the solution sets G ( K , F ) , H ( K , F ) , W ( K , F ) and S ( K , F ) are arcwise connected. In fact, by virtue of Lemma 4, we can compute G ( K , F ) = [ 0 , π 2 ] and H ( K , F ) = W ( K , F ) = S ( K , F ) = [ 0 , π 2 ) . It is clear that all these sets are convex. Thus, they are arcwise connected.

4. Conclusions

In this research, we prove the arcwise connectedness for several kinds of efficient solution sets for (GVEP) under suitable assumptions of natural quasi cone-convexity and natural quasi cone-concavity. Here, the scalar characterizations for these efficient solutions play important roles in the proofs. We also give examples to illustrate our main results. We note that the efficient solution set E ( K , F ) of (GVEP) is not well behaved since the set C \ { 0 } is neither open nor closed in general. Thus, how to explore the arcwise connectedness for the efficient solution set E ( K , F ) is yet a challenging work.

Author Contributions

Q.L. and S.W. conceived, designed and wrote the paper together. Both authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by the National Natural Science Foundation of China (11661055, 11801257, 71971102), the Natural Science Foundation of Jiangxi Province (20151BAB201020) and the Science and Technology Research Project of Jiangxi Educational Committee (208708).

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Acknowledgments

The authors are grateful to the anonymous reviewers whose questions, comments and suggestions helped improve an earlier version of this paper.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Ansari, Q.H.; Köbis, E.; Yao, J.C. Vector Variational Inequalities and Vector Optimization: Theory and Applications; Springer: Berlin, Germany, 2018. [Google Scholar]
  2. Chen, G.Y.; Huang, X.X.; Yang, X.Q. Vector Optimization, Set-Valued and Variational Analysis; Springer: Berlin, Germany, 2005. [Google Scholar]
  3. Giannessi, F. (Ed.) Vector Variational Inequalities and Vector Equilibrium; Kluwer Academic Publishers: Dordrecht, The Netherlands, 2000. [Google Scholar]
  4. Göpfert, A.; Riahi, H.; Tammer, C.; Zǎlinescu, C. Variational Methods in Partially Ordered Spaces; Springer: Berlin, Germany, 2003. [Google Scholar]
  5. Zhong, R.Y.; Huang, N.J.; Wong, M.M. Connectedness and path-connectedness of solution sets to symmetric vector equilibrium problems. Taiwan. J. Math. 2009, 13, 821–836. [Google Scholar] [CrossRef]
  6. Gong, X.H. Efficiency and Henig efficiency for vector equilibrium problems. J. Optim. Theory Appl. 2001, 108, 139–154. [Google Scholar] [CrossRef]
  7. Gong, X.H. Connectedness of the solution sets and scalarization for vector equilibrium problems. J. Optim. Theory Appl. 2007, 133, 151–161. [Google Scholar] [CrossRef]
  8. Gong, X.H.; Yao, J.C. Connectedness of the set of efficient solutions for generalized systems. J. Optim. Theory Appl. 2008, 138, 189–196. [Google Scholar] [CrossRef]
  9. Han, Y.; Huang, N.J. Existence and connectedness of solutions for generalized vector quasi-equilibrium problems. J. Optim. Theory Appl. 2018, 179, 65–85. [Google Scholar] [CrossRef]
  10. Chen, B.; Liu, Q.Y.; Liu, Z.B.; Huang, N.J. Connectedness of approximate solutions set for vector equilibrium problems in Hausdorff topological vector spaces. Fixed Point Theory Appl. 2011, 2011, 36. [Google Scholar] [CrossRef] [Green Version]
  11. Han, Y.; Huang, N.J. The connectedness of the solutions set for generalized vector equilibrium problems. Optimization 2016, 65, 357–367. [Google Scholar] [CrossRef]
  12. Xu, Y.D.; Zhang, P.P. Connectedness of solution sets of strong vector equilibrium problems with an application. J. Optim. Theory Appl. 2018, 178, 131–152. [Google Scholar] [CrossRef]
  13. Peng, Z.Y.; Wang, X.F.; Yang, X.M. Connectedness of approximate efficient solutions for generalized semi-infinite vector optimization problems. Set-Valued Var. Anal. 2019, 24, 103–118. [Google Scholar] [CrossRef]
  14. Peng, Z.Y.; Wang, Z.Y.; Yang, X.M. Connectedness of solution sets for weak generalized symmetric Ky Fan inequality problems via addition-invariant sets. J. Optim. Theory Appl. 2020, 184, 188–206. [Google Scholar] [CrossRef]
  15. Shao, C.Y.; Peng, Z.Y.; Xiao, Y.B.; Zhao, Y. Connectedness of solution sets for generalized vector equilibrium problems via free-disposal sets in complete metric space. Optim. Lett. 2021, in press. [Google Scholar] [CrossRef]
  16. Fu, J.Y. Generalized vector quasi-equilibrium problems. Math. Meth. Oper. Res. 2000, 52, 57–64. [Google Scholar] [CrossRef]
  17. Aubin, J.P.; Ekeland, I. Applied Nonlinear Analysis; Wiley: New York, NY, USA, 1984. [Google Scholar]
  18. Gong, X.H. On the contractibility and connectedness of an efficient point set. J. Math. Anal. Appl. 2001, 264, 465–478. [Google Scholar] [CrossRef] [Green Version]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Li, Q.; Wang, S. Arcwise Connectedness of the Solution Sets for Generalized Vector Equilibrium Problems. Mathematics 2021, 9, 2532. https://doi.org/10.3390/math9202532

AMA Style

Li Q, Wang S. Arcwise Connectedness of the Solution Sets for Generalized Vector Equilibrium Problems. Mathematics. 2021; 9(20):2532. https://doi.org/10.3390/math9202532

Chicago/Turabian Style

Li, Qiuying, and Sanhua Wang. 2021. "Arcwise Connectedness of the Solution Sets for Generalized Vector Equilibrium Problems" Mathematics 9, no. 20: 2532. https://doi.org/10.3390/math9202532

APA Style

Li, Q., & Wang, S. (2021). Arcwise Connectedness of the Solution Sets for Generalized Vector Equilibrium Problems. Mathematics, 9(20), 2532. https://doi.org/10.3390/math9202532

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop