Next Article in Journal
Synthesis Methodology for Discrete MIMO PID Controller with Loop Shaping on LTV Plant Model via Iterated LMI Restrictions
Next Article in Special Issue
An Analysis of the Nonstandard Finite Difference and Galerkin Methods Applied to the Huxley Equation
Previous Article in Journal
Numerical Investigation of Double-Diffusive Convection in an Irregular Porous Cavity Subjected to Inclined Magnetic Field Using Finite Element Method
Previous Article in Special Issue
Proximal Analytic Center Cutting Plane Algorithms for Variational Inequalities and Nash Economic Equilibrium
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Generalized Vector Quasi-Equilibrium Problems

by
Adela Elisabeta Capătă
Department of Mathematics, Technical University of Cluj-Napoca, 400027 Cluj-Napoca, Romania
Mathematics 2024, 12(6), 809; https://doi.org/10.3390/math12060809
Submission received: 5 February 2024 / Revised: 5 March 2024 / Accepted: 8 March 2024 / Published: 9 March 2024
(This article belongs to the Special Issue Variational Inequality and Mathematical Analysis)

Abstract

:
The aim of this paper is to present new existence results for solutions to a generalized quasi-equilibrium problem with set-valued mappings and moving cones. The key to this approach is a new Browder-type fixed point theorem, which permits working in a new direction with the milder condition of transfer open-valued mapping and considering weaker assumptions on the coving cone. These results are applied to some generalized vector quasi-equilibrium problems with trifunctions and to a vector quasi-equilibrium problem with fuzzy mappings in a fuzzy environment.

1. Introduction

Let X and Y be two topological vector spaces, K X a nonempty subset, S : K 2 K a set-valued mapping with nonempty values, and C : K 2 Y a set-valued mapping such that C ( x ) is a solid convex cone for all x K . Taking a vector-valued mapping, h : K × K Y , the generalized vector quasi-equilibrium problem, studied in [1], consists of finding
x ¯ S ( x ¯ ) such that h ( x ¯ , u ) Y ( int C ( x ¯ ) ) , for all u S ( x ¯ ) ,
and it can be extended to the set-valued mapping H : K × K 2 Y into the following ways:
( V Q E P ) find x ¯ S ( x ¯ ) such that H ( x ¯ , u ) Y ( int C ( x ¯ ) ) , for all u S ( x ¯ ) ,
or
( V Q E P 1 ) find x ¯ S ( x ¯ ) such that H ( x ¯ , u ) int C ( x ¯ ) , for all u S ( x ¯ ) .
Obviously, each solution to ( V Q E P ) is also a solution to ( V Q E P 1 ) .
The domain of vector quasi-equilibrium problems offers a general, unified, and natural framework for the study of a large variety of problems, such as vector quasi-optimization problems, vector quasi-variational problems, and vector quasi-complementarity problems. Since the decision-maker may vary with the time, in recent years, the authors have turned their attention to various vector quasi-equilibrium problems with variable ordering structure. The ordering structure is represented by set-valued mappings whose images are cones. Existence results for the solutions to these problems were obtained by means of KKM-Fan theorem [2,3,4,5,6,7,8], Kakutani–Fan–Glicksberg theorem [1,6,9,10], Browder-type fixed-point theorem [4], or coincidence theorems [11]. Within these results, C ( x ) is assumed to be a closed solid convex cone, and usually, the upper semicontinuity or the closedness of C ( · ) is demanded.
In this paper, we focus on the problem ( V Q E P ) , and using a Browder-type fixed-point theorem, we provide sufficient conditions for the existence of solutions to this problem. This approach involves the set of fixed points for a given set-valued mapping, and it allows dealing with a set-valued cone mapping C, whose images C ( x ) are pointed, solid, and convex cones. In Section 2, we recall some definitions and auxiliary results that we will need in this paper. Section 3 is devoted to the study of ( V Q E P ) , and the main existence result is stated. The key to its proof is a recent Browder-type fixed-point theorem that involves the milder concept of transfer open value and some convexity demands. This new fixed-point theorem allows us to work in a new direction and to obtain new results for generalized vector equilibrium problems. Within the results, it is only assumed that C ( x ) is a solid convex cone, for all x K . Then, in Section 4, we obtain some results for generalized vector quasi-equilibrium problems with trifunctions. The considered set-valued mapping T, from these problems, is assumed to take nonempty convex values, while T 1 is transfer open-valued on K. In Section 5, the results are applied to vector quasi-equilibrium problems with fuzzy mappings, in fuzzy environments. Our statements improve other results, and they are compared with the existing ones from the literature.

2. Preliminaries

Within this section, we recall some definitions and well-known results. From now on, X and Y are assumed to be two topological vector spaces, until otherwise is stated. Recall that a subset C of Y is called a convex cone if t C C , for every t 0 , and C + C C . Let Y * be the topological dual space of Y, and let
C * = { y * Y * y * ( c ) 0 , for all c C }
be the positive dual cone of C. The quasi-interior of C * is the set
C = { y * C * y * ( c ) > 0 , for all c C { 0 Y } } .
C is nonempty if and only if C has a base, i.e., there exists B such that C = cone ( B ) and 0 Y B ¯ (see, e.g. [12]. For a nonempty set M K , int M and int K M stand for the interior of M and the interior of M in the relative topology of K, while co M and M ¯ denote the convex hull and the closure of M, respectively. Given a set-valued mapping F : K 2 K , by fix F , we understand the set of all fixed points of F, i.e., fix F = { x K x F ( x ) } . Note that fix F is closed whenever F is closed (see, e.g., [13]), namely Gr ( F ) = { ( x , y ) x K , y F ( x ) } is closed in K × K .
Definition 1 
([3]). Let K be a nonempty convex subset of X and F : K 2 Y a set-valued mapping with nonempty values. F is said to be upper C-convex if, for any x 1 , x 2 K and any t [ 0 , 1 ] , it holds that
t F ( x 1 ) + ( 1 t ) F ( x 2 ) F ( t x 1 + ( 1 t ) x 2 ) + C .
The concept of upper C-convex mapping can be found in the literature also under the terminology of C-convex mapping (see, for instance, [14], [15] or [16]). Having a moving ordering cone, this concept can be generalized as follows.
Definition 2. 
Let K be a nonempty convex subset of X, C : K 2 Y , a set-valued mapping such that C ( x ) is a pointed solid convex cone for all x K , and F : K × K 2 Y a set-valued mapping with nonempty values. F is said to be upper C ( x ) -convex mapping in its second variable if, for any x , y 1 , y 2 K and any t [ 0 , 1 ] , it holds that
t F ( x , y 1 ) + ( 1 t ) F ( x , y 2 ) F ( x , t y 1 + ( 1 t ) y 2 ) + C ( x ) .
When C ( x ) = C , then the concept of upper C ( x ) -convex mapping, reduces to the one of upper C-convex mapping of F ( x , · ) , for all x K . For other concepts of generalized convexity with moving cones, we refer the reader to [4,5].
Definition 3 
([17]). Let C be a proper convex cone and F : X 2 Y a set-valued mapping with nonempty values. Then, F is said to be C-lower semicontinuous at x 0 X if, for any y F ( x 0 ) and any open set V of y, there exists U an open neighbourhood of x 0 such that
F ( x ) ( V + C ) ,   f o r   a l l   x U .
F is said to be C-lower semicontinuous on X if it is C-lower semicontinuous at each x 0 X .
In the case of single-valued mappings, we recover the C-lower semicontinuity notion, while, by replacing C with C , the C-upper semicontinuity notion is recovered. The following lemma about C-lower semicontinuous mappings is stated in Lemma 2 in [16].
Lemma 1. 
Let K be a nonempty subset of X and F : K 2 Y a C-lower semicontinuous set-valued mapping on K. Then, the set
{ x K F ( x ) Y int C }
is closed in K.
Definition 4 
([18]). Let K be a nonempty subset of X. A set-valued mapping F : K 2 Y has open lower sections, if, for any y Y , the set
{ x K y F ( x ) }
is open in K.
The next concept, namely the notion of transfer open value, is much weaker than the notion of the open lower section.
Definition 5 
([19]). Let X and Y be two topological spaces. A set-valued mapping F : X 2 Y is said to have transfer open value on X, if for every x X and y F ( x ) , it implies that there exists x X such that y int F ( x ) .
Remark 1. 
Note that if a mapping F : X 2 Y has open lower sections, then F 1 is transfer open-valued on Y.
The following generalisation of the Browder fixed-point theorem was stated in Theorem 2.8 in [20].
Theorem 1. 
Let K be a nonempty, convex, and compact subset of a real Hausdorff topological vector space X. Let F : K 2 K be a set-valued mapping such that
(i) 
For each x K , F ( x ) is a nonempty convex subset of K;
(ii) 
F 1 is transfer open-valued on K.
Then, there exists x * K such that x * F ( x * ) .
Definition 6. 
A multimap F : X 2 Y is called compact if the closure of its range F ( X ) is relatively compact in Y, i.e., F ( X ) ¯ is compact in Y.
Lemma 2 
([21]). Let X and Y be topological spaces, and let F : X 2 Y . Then, the following statements are equivalent:
(i) 
X = { int F 1 ( y ) y Y } ;
(ii) 
F 1 : Y 2 X is transfer open valued on Y, and for all x X , F ( x ) is nonempty.
To the end of this section, we recall a continuous selection theorem due to Horvath [22].
Theorem 2. 
Let X be a paracompact Hausdorff space, Y a convex space, G , T : X 2 Y two set-valued mappings such that co G ( x ) T ( x ) , for any x X , and X = { int G 1 ( y ) | y Y } . Then, T has a continuous selection f : X Y , that is, f ( x ) T ( x ) for all x X .

3. Main Section

Within this section, sufficient conditions for the existence of solutions to the problem ( V Q E P ) are provided, by using a technique relying on a Bowder-type fixed-point theorem.
Theorem 3. 
Let K be a nonempty, compact, and convex subset of X, C : K 2 Y a set-valued mapping such that C ( x ) is a pointed solid convex cone for all x K , H : K × K 2 Y a set-valued mapping with nonempty values, and S : K 2 K a mapping with nonempty convex values such that fix S is closed. Assume that the following conditions are satisfied:
(i) 
H ( x , x ) Y ( int C ( x ) ) for all x fix S ;
(ii) 
{ u K | H ( x , u ) Y ( int C ( x ) ) } is convex for all x fix S ;
(iii) 
S 1 is transfer open valued on K;
(iv) 
The mapping u K { x K | H ( x , u ) Y ( int C ( x ) ) , a n d u S ( x ) } is transfer open-valued on K.
  • Then, the problem ( V Q E P ) is solvable.
Proof. 
The set-valued mapping S fulfils all the assumptions of Theorem 1, and therefore, fix S . With the aid of fix S , we construct a set-valued mapping G : K 2 K as follows:
G ( x ) = F ( x ) S ( x ) , if x fix S , S ( x ) , if x fix S ,
where F : K 2 K is defined as
F ( x ) = { u K H ( x , u ) Y ( int C ( x ) ) } .
For every x K , G ( x ) is a convex set due to F and S set-valued mappings with convex values. By contradiction, suppose that G has nonempty values. In order to prove that G 1 is transfer open valued on K, let u K . Thus,
G 1 ( u ) = { x K u G ( x ) } = { x fix S u ( F S ) ( x ) } { x K fix S u S ( x ) } = fix S ( F S ) 1 ( u ) ( K fix S ) S 1 ( u ) ,
and, by the distribution rule of union, it comes out that G 1 ( u ) equals
= fix S ( F S ) 1 ( u ) K fix S fix S ( F S ) 1 ( u ) S 1 ( u ) = K ( F S ) 1 ( u ) ( K fix S ) [ fix S S 1 ( u ) ( ( F S ) 1 ( u ) S 1 ( u ) ) ] .
Because ( F S ) ( x ) S ( x ) for all x K , ( F S ) 1 ( u ) S 1 ( u ) for any u K . The above inclusion and the distribution rule of intersection provide that
G 1 ( u ) = K ( F S ) 1 ( u ) ( K fix S ) fix S S 1 ( u ) S 1 ( u ) = ( F S ) 1 ( u ) ( K fix S ) S 1 ( u ) = ( F S ) 1 ( u ) ( K fix S ) S 1 ( u ) .
Now, let x G 1 ( u ) . The following cases are distinguished.
(i)
If x ( F S ) 1 ( u ) , then due to assumption (iv), there exists u K such that
x int K ( F S ) 1 ( u ) int K G 1 ( u ) .
(ii)
If x ( K fix S ) A 1 ( u ) , we have that x K fix S , which is an open set in the relative topology on K, and that x S 1 ( u ) . Assumption (ii) assures the existence of an element u K such that x int K S 1 ( u ) , and therefore,
x int K ( K fix S ) S 1 ( u ) int K G 1 ( u ) .
So, G 1 is transfer open-valued on K.
Since G verifies all the assumptions of Theorem 1, then there exists x * K such that x * G ( x * ) . The following cases hold.
(i)
If x * fix S , then x * F ( x * ) S ( x * ) , wherefrom x * F ( x * ) , i.e., H ( x * , x * ) Y ( int C ( x * ) ) , which contradicts condition (i).
(ii)
If x * K fix S , then x * S ( x * ) , i.e., x * fix S , which is impossible.
Thus, the conjecture made is false, and therefore, there exists at least one x ¯ K such that G ( x ¯ ) = . If
(i)
x ¯ fix S , then F ( x ¯ ) S ( x ¯ ) = . So, there exists x ¯ fix S such that
H ( x ¯ , u ) Y ( int C ( x ¯ ) ) , for all u S ( x ¯ ) .
(ii)
x ¯ K fix S , then S ( x ¯ ) = it is a contradiction to the fact that S takes nonempty values.
Therefore, there exists x ¯ S ( x ¯ ) such that
H ( x ¯ , u ) Y ( int C ( x ¯ ) ) , for all u S ( x ¯ ) .
By taking C ( x ) = C , for all x K , in Theorem 3, then Theorem 4 represents an improvement of Theorem 3.1 in [23] in the sense that H ( x , x ) Y ( int C ) is required only for all x fix S and not for all the elements from the set K. We notice that Theorem 3 also provides sufficient conditions for the existence of solutions to the problem ( V Q E P 1 ) . Although the weaker transfer open concept is used, Theorem 3 is different from Corollary 3.5 in [3], Theorem 3.1 in [1], Theorem 3.1 in [5], and Theorems 3.1 and 3.2 in [7], approaches relied on by other theorems, where pseudomonotonicity assumptions or other generalized convexity concepts are assumed.
Theorem 4. 
Let K be a nonempty, compact, and convex subset of X, H : K × K 2 Y a set-valued mapping with nonempty values, and S : K 2 K a mapping with nonempty convex values such that fix S is closed. Assume that the following conditions are satisfied:
(i) 
H ( x , x ) Y ( int C ) for all x fix S ;
(ii) 
{ u K | H ( x , u ) Y ( int C ) } is convex for all x fix S ;
(iii) 
S 1 is transfer open valued on K;
(iv) 
The mapping u K { x K | H ( x , u ) Y ( int C ) a n d u S ( x ) } is transfer open-valued on K.
  • Hence, there exists x ¯ S ( x ¯ ) such that
H ( x ¯ , u ) Y ( int C ) ,   f o r   a l l   u S ( x ¯ ) .
Proof. 
Take in Theorem 3, C ( x ) = C for all x K . □
The next statement provides some conditions under which the assumptions of Theorem 3 are satisfied.
Corollary 1. 
Let K X be a nonempty, compact, and convex subset of X, C : K 2 Y a set-valued mapping such that C ( x ) is a pointed solid convex cone for all x K , H : K × K 2 Y a set-valued mapping with nonempty values, and S : K 2 K a nonempty convex valued mapping with open lower sections such that fix S is closed. Assume that the following conditions are satisfied:
(i) 
H ( x , x ) Y ( int C ( x ) ) for all x fix S ;
(ii) 
For every u K , { x K | H ( x , u ) Y ( int C ( x ) ) } is an open set in K;
(iii) 
For every x K , H is an upper C ( x ) , mapping its second variable.
  • Therefore, problem ( V Q E P ) is solvable.
Proof. 
Since S has open lower sections, then S 1 is transfer open-valued on K and the set
{ x K H ( x , u ) Y ( int C ( x ) ) and u S ( x ) } =
= { x K H ( x , u ) Y ( int C ( x ) ) } S 1 ( u )
is open, for all u K , and thus conditions (ii) and (iv) of Theorem 3 are verified. It remains for us to check the convexity of { u K | H ( x , u ) Y ( int C ( x ) ) } , for all x fix S . So, let u 1 , u 2 K and t [ 0 , 1 ] such that
H ( x , u 1 ) Y ( int C ( x ) ) and H ( x , u 2 ) Y ( int C ( x ) ) .
Because of this, there exists z 1 H ( x , u 1 ) ( int C ( x ) ) and z 2 H ( x , u 2 ) ( int C ( x ) ) such that t z 1 + ( 1 t ) z 2 int C ( x ) and
t z 1 + ( 1 t ) z 2 t H ( x , u 1 ) + ( 1 t ) H ( x , u 2 ) H ( x , t u 1 + ( 1 t ) u 2 ) + C ( x ) .
Therefore, we conclude that
H ( x , t u 1 + ( 1 t ) u 2 ) ( int C ( x ) ) ,
and so { u K | H ( x , u ) Y ( int C ( x ) ) } is a convex set. □
Corollary 2. 
Let K X be a nonempty, compact, and convex subset, H : K × K 2 Y a set-valued mapping with nonempty values, and S : K 2 K a nonempty convex valued mapping with open lower sections such that fix S is closed. Assume that the following conditions are satisfied:
(i) 
H ( x , x ) Y ( int C ) for all x fix S ;
(ii) 
For every u K , the set-valued mapping x H ( x , u ) : K 2 Y is C lower semicontinuous on K;
(iii) 
For every x K , the set-valued mapping u H ( x , u ) : K 2 Y is an upper C mapping.
  • Hence, there exists x ¯ S ( x ¯ ) such that
H ( x ¯ , u ) Y ( int C ) ,   f o r   a l l   u S ( x ¯ ) .
Proof. 
In order to apply Corollary 1, with C ( x ) = C for all x K , it remains for us to check assumption (ii). For every u K , by Lemma 1, the set { x K | H ( x , u ) Y ( int C ) } is closed, wherefrom
{ x K | H ( x , u ) Y ( int C ) }
is an open set in K. □
By taking X = Z in Theorem 2 in [11], for the above problem, an existence result is obtained, but for the particular case in which S ( x ) = K , for all x K . Even if we consider the milder concept of C -lower semicontinuouity in the first variable instead of the lower semicontinuity assumption, Corollary 2 is different from Theorem 12 in [11], where other concepts of generalized convexity are used and other types of assumptions are made.

4. Applications to Generalized Vector Quasi-Equilibrium Problems with Trifunctions

In the sequel, the results are applied to ( Q V E P 2 ) , a generalized vector quasi-equilibrium problem with set-valued mappings, which consists of finding
x ¯ S ( x ¯ ) , y ¯ T ( x ¯ ) such that G ( x ¯ , y ¯ , u ) Y ( int C ) , u S ( x ¯ ) ,
where D is a nonempty subset of a topological space, and S : K 2 K , T : K 2 D and G : K × D × K 2 Y are set-valued mappings.
Theorem 5. 
Let K be a nonempty, convex, and compact subset of a complete Hausdorff locally convex space X, D a convex subset of a topological vector space, T : K 2 D a set-valued mapping with nonempty convex values, S : K 2 K a compact set-valued mapping with nonempty convex values, open lower sections such that fix S is closed. If G ( x , y , x ) Y ( int C ) , for all ( x , y ) fix S × T ( K ) and the following conditions are satisfied:
(i) 
K = { int T 1 ( d ) | d D } ;
(ii) 
For all ( x , y ) fix S × T ( K ) , the set { u K G ( x , y , u ) Y ( int C ) } is convex;
(iii) 
G is C -lsc in its first and second variable;
  • then, the problem ( Q V E P 2 ) is solvable.
Proof. 
Firstly, a continuous selection for T is provided, and with its help a new set-valued mapping is introduced. As T has convex values, then co T ( x ) = T ( x ) . By Lemma 2 and Theorem 2, there exists f : K D , a continuous function such that f ( x ) T ( x ) , for all x K .
Further, S compact, gives S ( K ) ¯ compact set in K. Therefore, according to Theorem 4.8.9 in [24], the set
K = co ¯ S ( K ) ¯
is convex and compact.
Consider now the auxiliary set-valued mapping H : K × K 2 K , defined by
H ( x , u ) = G ( x , f ( x ) , u ) , ( x , u ) K × K .
As K is a convex subset of K, by assumption (ii), the set
{ u K | G ( x , f ( x ) , u ) Y ( int C ) } = { u K | H ( x , u ) Y ( int C ) }
is convex for all x fix S . In order to apply Theorem 4, it remains for us to prove that H is C -lsc on K in its first variable. So, let x 0 K , and let z 0 H ( x 0 , u ) = G ( x 0 , f ( x 0 ) , u ) . Further, let V N ( z 0 ) . By the C -lsc of G in its first variable, there exists U 1 N ( x 0 ) such that
G ( x , f ( x 0 ) , u ) ( V C ) , x U 1 .
Consequently, there exists z G ( x , f ( x 0 ) , u ) such that z V C . As V C N ( z ) , by the C -lsc of G in its second variable, there exists W N ( f ( x 0 ) ) such that
G ( x , y , u ) ( V C C ) , y W .
By the continuity of f and W N ( f ( x 0 ) ) , there exists U 2 N ( x 0 ) such that f ( x ) W , for all x U 2 . Taking now U = U 1 U 2 N ( x 0 ) , it takes place as follows:
G ( x , f ( x ) , u ) ( V C ) , x U ,
namely H is C -lsc in its first variable.
As G ( x , y , x ) Y ( int C ) , for all ( x , y ) fix S × T ( K ) , we obtain H ( x , x ) Y ( int C ) for all x fix S . Thus, all the assumptions of Theorem 4 are verified, and so there exist x ¯ S ( x ¯ ) and y ¯ = f ( x ¯ ) T ( x ¯ ) such that
G ( x ¯ , y ¯ , u ) Y ( int C ) , u S ( x ¯ ) .
The convexity hypothesis (ii) of Theorem 5 is replaced in the following corollary by the upper C mapping demand on G in its third variable.
Corollary 3. 
Let K be a nonempty, convex, and compact subset of a complete Hausdorff locally convex space X, D a convex subset of a topological vector space, T : K 2 D a set-valued mapping with nonempty convex values, and S : K 2 K a compact set-valued mapping with nonempty convex values, open lower sections such that fix S is closed. If G ( x , y , x ) Y ( int C ) , for all ( x , y ) fix S × T ( K ) and the following conditions are satisfied:
(i) 
K = { int T 1 ( d ) | d D } ;
(ii) 
G is an upper C-mapping in its third variable;
(iii) 
G is C -lsc in its first and second variable;
  • then, the problem ( Q V E P 2 ) is solvable.
Proof. 
Condition (ii) implies assumption (ii) of Theorem 5, and the conclusion follows now by this. □
Remark 2. 
In Theorem 7 in [25], the authors stated an existence result for ( Q V E P 2 ) , by considering some acyclic assumptions and that G is a continuous set-valued mapping on its domain. Corollary 3 has the milder C -lower semicontinuity assumption on G, and the additional upper C-mapping assumption. Moreover, instead of G ( x , y , x ) C for all ( x , y ) K × D , we have a much weaker demand, namely G ( x , y , x ) Y ( int C ) , for all ( x , y ) fix S × T ( K ) .
The next lemma allows obtaining a new statement for the existence of solutions to the problem ( Q V E P 2 ) . Within this result, the compactness assumption on S is dropped, and in addition, the upper semicontinuity of S is demanded.
Lemma 3 
([26]). Let X be a real topological vector space, S : X 2 X be upper semicontinuous on X, and K a compact subset of X. Then, S ( K ) is compact.
Theorem 6. 
Let K be a nonempty, convex, and compact subset of a complete Hausdorff locally convex space X, D a convex subset of a topological vector space, T : K 2 D a set-valued mapping with nonempty convex values, and S : K × K 2 K an upper semicontinuous set-valued mapping on K with nonempty convex values, open lower sections such that fix S is closed. If G ( x , y , x ) Y ( int C ) , for all ( x , y ) fix S × T ( K ) and the following conditions are satisfied:
(i) 
K = { int T 1 ( d ) | d D } ;
(ii) 
For all ( x , y ) fix S × T ( K ) , the set { u K G ( x , y , u ) Y ( int C ) } is convex;
(iii) 
G is C -lsc in its first and second variable;
  • then, problem ( Q V E P 2 ) is solvable.
Proof. 
It follows by Lemma 3, and it is similar to the proof of Theorem 5. □
Taking now S ( x ) = K , for all x K , the next result holds, and it also provides sufficient conditions for the existence of solutions to the vector quasi-equilibrium problem considered in [8]. Although conditions (ii) and (iii) appear in Theorem 3.1 in [8], where a coercivity condition replaces the compactness assumption on K, some additional assumptions are demanded on G, and different assumptions are considered on T.
Theorem 7. 
Let K be a nonempty, convex, and compact subset of a complete Hausdorff locally convex space X, D a convex subset of a topological vector space, and T : K 2 D a set-valued mapping with nonempty convex values. If G ( x , y , x ) Y ( int C ) , for all ( x , y ) K × T ( K ) and the following conditions are satisfied:
(i) 
K = { int T 1 ( d ) | d D } ;
(ii) 
G is an upper C-mapping in its third variable;
(iii) 
G is C -lsc in its first and second variable;
  • then, there exists x ¯ K , y ¯ T ( x ¯ ) such that
G ( x ¯ , y ¯ , u ) Y ( int C ) , u K .
Under the condition that C is a based cone, by Corollary 3, the solutions are obtained to another generalized vector quasi-equilibrium problem.
Theorem 8. 
Let C be a based cone, K a nonempty convex and compact subset of a complete Hausdorff locally convex space X, D a convex subset of a topological vector space, T : K 2 D a set-valued mapping with nonempty convex values, and S : K × 2 K a compact set-valued mapping with nonempty convex values, open lower sections such that fix S is closed. If G ( x , y , x ) C , for all ( x , y ) fix S × T ( K ) and the following conditions are satisfied:
(i) 
K = { int T 1 ( d ) | d D } ;
(ii) 
G is an upper C-mapping in its third variable;
(iii) 
G is C -lsc in its first and second variable;
  • then, there exists x ¯ S ( x ¯ ) , y ¯ T ( x ¯ ) such that
G ( x ¯ , y ¯ , u ) Y ( C { 0 Y } ) , u S ( x ¯ ) .
Proof. 
Since C is a based cone, then C . Let c * C and define
C ¯ = { y Y | c * ( y ) > 0 } { 0 Y } .
It is easy to see that, C ¯ is a solid convex cone, with the property that C { 0 Y } int C ¯ . Since G ( x , y , x ) C , it implies G ( x , y , x ) C ¯ , and therefore, G ( x , y , x ) Y ( int C ¯ ) . As all the assumptions of Corollary 3 are verified, there exist x ¯ S ( x ¯ ) and y ¯ T ( x ¯ ) such that
G ( x ¯ , y ¯ , u ) Y ( int C ¯ ) , u S ( x ¯ ) .
wherefrom
G ( x ¯ , y ¯ , u ) Y ( C { 0 Y } ) , u S ( x ¯ ) .

5. An Application to a Vector Quasi-Equilibrium Problem with Fuzzy Mappings in a Fuzzy Environment

The theory of fuzzy sets started in 1965 with the publication by L. Zadeh [27]. Fuzzy logic allows decision making with estimated values under incomplete or uncertain information. Since then, the attention of the researchers also turned to generalized games and equilibrium problems with fuzzy mappings and their particular cases (see, for instance [28,29,30,31,32] and the references therein).
A fuzzy set on K is a function with domain K and values in [ 0 , 1 ] . By F ( K ) , we denote the collection of all fuzzy sets on K. A mapping f : K F ( K ) is called a fuzzy mapping, and we denote f ( x ) : = f x , for all x K , which is a fuzzy set on K. For any u K , f x ( u ) [ 0 , 1 ] is called the degree of membership of u in f x , while the set
( f x ) λ = { u K | f x ( u ) > λ }
is called the strict λ -cut set of f x , with λ [ 0 , 1 ) (see, for instance [29,30]).
Definition 7 
([29]). A fuzzy mapping f : K F ( K ) is called convex, if for each x K , the fuzzy set f x is a fuzzy convex set, i.e., for any u 1 , u 2 K , for all t [ 0 , 1 ] ,
f x ( t u 1 + ( 1 t ) u 2 ) min { f x ( u 1 ) , f x ( u 2 ) } .
Observe that whenever f is a convex fuzzy mapping, then for any x K , the strong λ -cuts of f x are convex sets, for all λ [ 0 , 1 ) . Let h : K R be a real valued function. We say that h is upper semicontinuous on K, if for each t R , the set { x K h ( x ) < t } is open in K. We say that h is lower semicontinuous on K if h is upper semicontinuous on K, so that { x K h ( x ) > t } is open in K, for each t R .
Theorem 9. 
Let K be a nonempty, convex, and compact subset of a complete Hausdorff locally convex space X, D a nonempty convex subset of a topological vector space, s : K F ( K ) , t : K F ( D ) and g : K × D × K F ( Y ) be fuzzy mappings, α , β , γ : K [ 0 , 1 ) such that α and γ are upper semicontinuous functions on K, and the following conditions satisfied:
(i) 
For each x K , ( s x ) α ( x ) is nonempty, convex, { x K | x ( s x ) α ( x ) } is closed, while x K ( s x ) α ( x ) ¯ is compact in K, and for all u K the function x s x ( u ) is lower semicontinuous as a function of x;
(ii) 
For each x K , ( t x ) β ( x ) is nonempty convex, and K = d D int { x K | d ( t x ) β ( x ) } ;
(iii) 
For all z Y , the functions x g x , y , u ( z ) and y g x , y , u ( z ) are lower semicontinuous as a function of x, respectively, y, and the set
{ u K | ( g x , y , u ) γ ( x ) Y ( int C ) }
is convex for all ( x , y ) K × D ;
(iv) 
{ z Y g x , y , x ( z ) > γ ( x ) } Y ( int C ) , for all x { x K | x ( s x ) α ( x ) } and y D .
  • Hence, there exists x ¯ ( s x ¯ ) α ( x ¯ ) , y ¯ ( t x ¯ ) β ( x ¯ ) such that
( g x ¯ , y ¯ , u ) γ ( x ¯ ) Y ( int C ) , u ( s x ¯ ) α ( x ¯ ) .
Proof. 
Define the following set-valued mappings
S : K 2 K , T : K 2 D and G : K × D × K 2 Y
as S ( x ) = ( s x ) α ( x ) = { u K s x ( u ) > α ( x ) } , T ( x ) = ( t x ) β ( x ) = { d D t x ( d ) > β ( x ) } , and G ( x , y , u ) = ( g x , y , u ) γ ( x ) = { z Y g x , y , u ( z ) > γ ( x ) } .
By assumption (i), S ( x ) is nonempty and convex for all x K . For all u K , we have that the function x s x ( u ) α ( x ) is lower semicontinuous as a function of x, and therefore, the set
{ x K s x ( u ) α ( x ) > 0 }
is open in K. Moreover,
S 1 ( u ) = { x K | u S ( x ) } = { x K | s x ( u ) > α ( x ) }
is open, i.e., S has open lower sections. The fixed point set of S, namely
fix S = { x K | x S ( x ) } = { x K | s x ( x ) > α ( x ) }
is closed, while
S ( K ) ¯ = x K ( s x ) α ( x ) ¯
is compact, which means that S is compact.
Assumption (ii) provides that T has nonempty convex values and that
K = d D int { x K | d T ( x ) } = d D int T 1 ( d ) .
Let us check now the C -lsc of G in its first and second variable. For this, let x 0 K , z G ( x 0 , y , u ) , and V is an open neighbourhood of z. Therefore g x 0 , y , u ( z ) > γ ( x 0 ) and by the lower semicontinuity of x g x , y , u ( z ) γ ( x ) as a function of x, for ϵ = g x 0 , y , u ( z ) γ ( x 0 ) > 0 , we obtain the existence of a neighbourhood U of x 0 such that
g x , y , u ( z ) γ ( x ) g x 0 , y , u ( z ) + γ ( x 0 ) > ϵ , x U g x , y , u ( z ) > γ ( x ) , x U .
From, z G ( x , y , u ) for all x U and z V C it yields
G ( x , y , u ) ( V C ) , x U .
Now, let y 0 K , z G ( x , y 0 , u ) , and V an open neighbourhood of z. So, g x , y 0 , u ( z ) > γ ( x ) , and by the lower semicontinuity of y g x , y , u ( z ) as a function of y, choosing ϵ = g x , y 0 , u ( z ) γ ( x ) > 0 , we obtain the existence of a neighbourhood U of y 0 such that
g x , y , u ( z ) g x , y 0 , u ( z ) > ϵ , y U g x , y , u ( z ) > γ ( x ) , y U .
Consequently z G ( x , y , u ) for all y U , and together with z V C , it provides
G ( x , y , u ) ( V C ) , y U .
Assumption (iv) assures that G ( x , y , x ) Y ( int C ) , for all ( x , y ) fix S × D , and in particular, this holds for all ( x , y ) fix S × T ( K ) . As all the assumptions of Theorem 5 are verified, the proof is completed. □
Remark 3. 
If, for any d D , the function x t x ( d ) is lower semicontinuous as a function of x, and β : K [ 0 , 1 ) is upper semicontinuous, then T has open lower sections. Taking into consideration Remark 1 and Lemma 1, assumption
K = d D int { x K | d ( t x ) β ( x ) }
from condition (ii) of Theorem 9, can be replaced by the above semicontinuity assumptions.
The following example illustrates that all the assumptions of Theorem 9 are satisfied.
Example 1. 
Let K = D = [ 0 , 2 ] be nonempty, convex, and compact sets, Y = R , C = [ 0 , ) , s : K F ( K ) , t : K F ( D ) , g : K × D × K F ( Y ) be fuzzy mappings defined by
s x ( u ) = 1 x [ 0 , 1 ] , u ( 1 , 2 ] ; u + x 2 + 2 4 x [ 0 , 1 ] , u [ 0 , 1 ] ; 1 x ( 1 , 2 ] , u ( 1 , 2 ] ; u + 3 4 , x ( 1 , 2 ] , u [ 0 , 1 ] , t x ( d ) = 1 1 + 2 d , x [ 0 , 2 ] , d [ 0 , 2 ] ,
g x , y , u ( z ) = 1 2 + 2 z + y 2 2 x [ 0 , 2 ] , y [ 0 , 2 ] , u [ 0 , 2 ] , z [ 0 , 10 ] ; 1 15 x [ 0 , 2 ] , y [ 0 , 2 ] , u [ 0 , 2 ] , z R [ 0 , 10 ] ,
and, let α , β , γ : K [ 0 , 1 ) be defined by
α ( x ) = x 2 + 1 4 x [ 0 , 1 ] ; 1 2 x ( 1 , 2 ] , β ( x ) = 1 7 + x 2 , γ ( x ) = 1 6 + 2 x 2 , x [ 0 , 2 ] .
Taking any x [ 0 , 1 ] , we have
S ( x ) = { u [ 0 , 2 ] s x ( u ) > α ( x ) } = { u [ 0 , 2 ] s x ( u ) > x 2 + 1 4 } = { u ( 1 , 2 ] 1 > x 2 + 1 4 } { u [ 0 , 1 ] u + x 2 + 2 4 > x 2 + 1 4 } = ( 1 , 2 ] [ 0 , 1 ] = [ 0 , 2 ] ,
while, for x ( 1 , 2 ] ,
S ( x ) = { u [ 0 , 2 ] s x ( u ) > α ( x ) } = { u [ 0 , 2 ] s x ( u ) > 1 2 } = { u ( 1 , 2 ] 1 > 1 2 } { u [ 0 , 1 ] u + 3 4 > 1 2 } = ( 1 , 2 ] [ 0 , 1 ] = [ 0 , 2 ] .
Because of these reasons, S ( x ) = [ 0 , 2 ] is nonempty and convex, for all x K , the set f i x S = [ 0 , 2 ] is closed, and x K S ( x ) ¯ = K is compact. Now, for any x K ,
T ( x ) = { d [ 0 , 2 ] t x ( d ) > β ( x ) } = { d [ 0 , 2 ] t x ( d ) > 1 7 + x 2 } = { d [ 0 , 2 ] 1 1 + 2 d > 1 7 + x 2 } = [ 0 , 2 ] ,
which is nonempty and convex. For all ( x , y , u ) K × D × K , we obtain that
G ( x , y , u ) = { z R g x , y , u ( z ) > γ ( x ) } = { z R g x , y , u ( z ) > 1 6 + 2 x 2 } = { z [ 0 , 10 ] 1 2 + 2 z + y 2 2 > 1 6 + 2 x 2 } { z R [ 0 , 10 ] 1 15 > 1 6 + 2 x 2 } = [ 0 , 2 + x 2 y 2 4 ) = [ 0 , 2 + x 2 y 2 4 ) .
and, by the upper C-convexity of G in its third argument, for all ( x , y ) K × D , we obtain the convexity of the set
{ u K G ( x , y , u ) Y ( i n t C ) } .
It is easy to check that G ( x , y , x ) Y ( i n t C ) , for all x f i x S and y D . The lower semicontinuity of the functions x s x ( u ) , x t x ( d ) , x g x , y , u ( z ) , y g x , y , u ( z ) , together with the upper semicontinuity of α , β , and γ completes the assumptions of Theorem 9, and any ( x ¯ , y ¯ ) , with x ¯ [ 0 , 2 ] and y ¯ [ 0 , 2 ] , is the solution to the vector quasi-equilibrium problem with fuzzy mappings.

6. Conclusions

The Browder-type fixed-point theorem, used throughout this paper, opens up a new research direction in the theory of vector quasi-equilibrium problems with set-valued mappings. Our results deal with some milder semicontinuity assumptions, but with different generalized convexity assumptions than those existent in the literature. On the moving cone C, we demand only that it is solid and convex, and no upper semicontinuity or closedness assumptions are made, as they are completed in the before-established results in this field.

Funding

This research received no external funding.

Data Availability Statement

No new data were created or analyzed in this study. Data sharing is not applicable to this article.

Acknowledgments

The author thanks the anonymous reviewers for their valuable suggestions and comments which improved the quality of the paper.

Conflicts of Interest

The author declares no conflicts of interest.

References

  1. Li, S.J.; Teo, K.L.; Yang, X.Q. Generalized vector quasi-equilibrium problem. Math. Meth. Oper. Res. 2005, 61, 385–397. [Google Scholar] [CrossRef]
  2. Chiang, Y.; Chadli, O.; Yao, J.C. Generalized vector equilibrium problems with trifunctions. J. Glob. Optim. 2004, 30, 135–154. [Google Scholar] [CrossRef]
  3. Duong, T.T.T.; Tan, N.X. On the existence of solutions to generalized quasi-equilibrium problems. J. Glob. Optim. 2012, 52, 711–728. [Google Scholar] [CrossRef]
  4. Fu, J.Y.; Wan, A.H. Generalized vector equilibrium problems with set-valued mappings. Math. Methods Oper. Res. 2002, 56, 259–268. [Google Scholar] [CrossRef]
  5. Konnov, I.V.; Yao, J.C. Existence of solutions for generalized vector equilibrium problems. J. Math. Anal. Appl. 1999, 233, 328–335. [Google Scholar] [CrossRef]
  6. Li, N.J.; Wang, S.H.; Xu, Y.P. Set-valued symmetric generalized strong quasi-equilibrium problems with variable ordering structures. Mathematics 2020, 8, 1604. [Google Scholar] [CrossRef]
  7. Lin, L.J.; Ansari, Q.H.; Wu, J.Y. Geometric properties and coincidence theorems with applications to generalized vector equilibrium problems. J. Optim. Theory Appl. 2003, 117, 121–137. [Google Scholar] [CrossRef]
  8. Liu, Q.M.; Fan, L.; Wang, G. Generalized vector quasi-equilibrium problems with set-valued mappings. Appl. Math. Lett. 2008, 21, 946–950. [Google Scholar] [CrossRef]
  9. Fu, J.Y. Stampacchia generalized vector quasiequilibrium problems and vector saddle points. J. Optim. Theory Appl. 2006, 128, 605–619. [Google Scholar] [CrossRef]
  10. Hung, N.V.; Köbis, E.; Tam, V.M. Existence of solutions and iterative algorithms for weak vector quasi-equilibrium problems. J. Nonlinear Convex Anal. 2020, 21, 479–493. [Google Scholar]
  11. Balaj, M. Coincidence and maximal element theorems and their applications to generalized equilibrium problems and minimax inequalities. Nonlinear Anal. 2008, 68, 3962–3971. [Google Scholar] [CrossRef]
  12. Göpfert, A.; Riahi, H.; Tammer, C.; Zălinescu, C. Variational Methods in Partially Ordered Spaces; Springer: New York, NY, USA, 2003. [Google Scholar]
  13. Aliprantis, C.D.; Border, K.C. Infinite Dimensional Analysis, 3rd ed.; Springer: Berlin, Germany, 2006. [Google Scholar]
  14. Borwein, J. Multivalued convexity and optimization: A unified approach to inequality and equality constraints. Math. Program. 1977, 13, 183–199. [Google Scholar] [CrossRef]
  15. Chen, G.Y.; Li, S.J. Existence of solutions for a generalized vector quasivariational inequality. J. Optim. Theory Appl. 1996, 90, 321–334. [Google Scholar] [CrossRef]
  16. Fu, J.Y. Vector equilibrium problems. Existence theorems and convexity of solution set. J. Glob. Optim. 2005, 31, 109–119. [Google Scholar] [CrossRef]
  17. Luc, D.T. Theory of Vector Optimization; Springer: Berlin, Germany, 1989. [Google Scholar]
  18. Wu, X.; Shen, S. A further generalization of Yannelis-Prabhakar’s continuous selection theorem and its applications. J. Math. Anal. Appl. 1996, 197, 61–74. [Google Scholar] [CrossRef]
  19. Tian, G.Q. Generalizations of the FKKM theorem and the Ky Fan minimax inequality, with applications to maximal elements, price equilibrium, and complementarity. J. Math. Anal. Appl. 1992, 170, 457–471. [Google Scholar] [CrossRef]
  20. Liu, J.; Wang, M.; Yuan, Y. Browder type fixed point theorems and Nash equilibria in generalized games. J. Fixed Point Theory Appl. 2020, 22, 71. [Google Scholar] [CrossRef]
  21. Lin, L.J.; Yu, Z.T.; Kassay, G. Existence of equilibria for multivalued mappings and its application to vectorial equilibria. J. Optim. Theory Appl. 2002, 114, 189–208. [Google Scholar] [CrossRef]
  22. Horvath, C.D. Contractibility and generalized convexity. J. Math. Anal. Appl. 1991, 156, 341–357. [Google Scholar] [CrossRef]
  23. Capătă, A. On vector quasi-equilibrium problems via a Browder-type fixed-point theorem. Bull. Malays. Math. Sci. Soc. 2023, 46, 14. [Google Scholar] [CrossRef]
  24. Narici, L.; Beckenstein, E. Topological Vector Spaces; Chapman and Hall: New York, NY, USA, 2010. [Google Scholar]
  25. Lin, L.J.; Yu, Z.T. On some equilibrium problems for multimaps. Nonlinear programming and variational inequalities. J. Comput. Appl. Math. 2001, 129, 171–183. [Google Scholar] [CrossRef]
  26. Berge, C. Topological Spaces; Dover Publications Inc.: Mineola, NY, USA, 1997. [Google Scholar]
  27. Zadeh, L.A. Fuzzy sets. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef]
  28. Hung, N.V.; Tam, V.M.; Zhou, Y. A new class of strong mixed vector GQVIP-generalized quasi-variational inequality problems in fuzzy environment with regularized gap functions based error bounds. J. Comput. Appl. Math. 2021, 381, 113055. [Google Scholar] [CrossRef]
  29. Kim, W.K.; Lee, K.H. Generalized fuzzy games and fuzzy equilibria. Fuzzy Sets Syst. 2001, 122, 293–301. [Google Scholar] [CrossRef]
  30. Patriche, M. Equilibrium of Bayesian fuzzy economies and quasi-variational inequalities with random fuzzy mappings. J. Inequal. Appl. 2013, 2013, 374. [Google Scholar] [CrossRef]
  31. Rahaman, M.; Ahmad, R. Fuzzy vector equilibrium problem. Iran. J. Fuzzy Syst. 2015, 12, 115–122. [Google Scholar]
  32. Tang, G.J.; Zhao, T.; Wan, Z.P.; He, D.X. Existence results of a perturbed variational inequality with a fuzzy mapping. Fuzzy Sets Syst. 2018, 331, 68–77. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Capătă, A.E. Generalized Vector Quasi-Equilibrium Problems. Mathematics 2024, 12, 809. https://doi.org/10.3390/math12060809

AMA Style

Capătă AE. Generalized Vector Quasi-Equilibrium Problems. Mathematics. 2024; 12(6):809. https://doi.org/10.3390/math12060809

Chicago/Turabian Style

Capătă, Adela Elisabeta. 2024. "Generalized Vector Quasi-Equilibrium Problems" Mathematics 12, no. 6: 809. https://doi.org/10.3390/math12060809

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