Introduction

Several classes of problems, including the vector variational inequality problem, the vector complementarity problem, the vector optimization problem and the vector saddle point problem, have been unified as a model of the vector equilibrium problem, which has been intensively studied in the literature (see [116]). One of the important topics in optimization theory is the stability analysis of the solution mappings for vector equilibrium problems. Stability may be understood as some types of lower or upper semicontinuity. Recently, the semicontinuity, especially the lower semicontinuity, of the solution mappings for parametric vector equilibrium problems has been intensively studied in various directions (see [1, 2, 4, 6, 10, 15] and references therein).

Anh and Khanh first obtained the semicontinuity of the solution mappings of parametric multivalued vector quasi-equilibrium problems (see [1]), and then obtained verifiable sufficient conditions for solution sets of general quasivariational inclusion problems to have these semicontinuity-related properties and discussed in detail a traffic network problem as a sample for employing the main results in practical situations (see [2]), and latter established sufficient conditions for lower and Hausdorff lower semicontinuity, upper semicontinuity, and continuity of solution mappings of parametric quasi-equilibrium problems in topological vector spaces (see [3]).

Gong and Yao, by virtue of a density result and a scalarization technique, first discussed the lower semicontinuity of the set of efficient solutions to parametric vector equilibrium problems with monotone bifunctions (see [4]), and studied the continuity of the solution mapping to parametric weak vector equilibrium problems (see [5]), recently, established the lower semicontinuity of solutions to the parametric generalized strong vector equilibrium problem without the assumptions of monotonicity of the objective mapping and compactness of the constraint mapping (see [6]). Huang et al. used local existence results to establish the lower semicontinuity of solution mappings for parametric implicit vector equilibrium problems (see [7]). By using a new proof which is different from the ones of [4, 5], Chen et al. established the lower semicontinuity and continuity of the solution mappings to a parametric generalized vector equilibrium problem (see [9]). Li and Fang investigated the lower semicontinuity of the solutions mapping to parametric generalized Ky Fan inequality under a weaker assumption than C-strict monotonicity (see [10]). Recently, by using an idea of [4], Li et al. established the continuity of solution mappings to a parametric generalized strong vector equilibrium problem for set-valued mappings under an assumption which is different from the C-strict monotonicity (see [11]). Kimura and Yao discussed the semicontinuity of solution mappings of parametric vector quasi-equilibrium problems (see [13]). Cheng and Zhu obtained a lower semicontinuity result of the solution mapping to weak vector variational inequalities in finite-dimensional spaces by using the scalarization method (see [14]).

Zhang et al. obtained the lower semicontinuity of solution mappings for parametric vector equilibrium problems under the Höder-related assumptions [15]. Wangkeeree et al. extended the results in [15] to the case of set-valued mappings on parametric strong vector equilibrium problems (see [16]).

However, all these results are with respect to the fixed order relationship in the object space, that is, the cone partial order is not perturbed by the parameters. Motivated by the idea of variational domination structure, the main results in [15] will be obtained under more weaker conditions in this paper.

The organization of this work is as follows. In Sect. 2, we introduce the efficient solutions to parametric vector equilibrium problems with the cone partial order being perturbed by the parameters and recall some basic notions. In Sect. 3, we discuss the lower semicontinuity of the (weak) efficient solution mappings for parametric vector equilibrium problems in the case of weakly conditions. Some examples are given to illustrate that the assumptions of the main results in our work or in [15] are only sufficient for some special problems and indicate also that our outcomes are real extension from the corresponding ones in [15].

Preliminaries

Let X and Z be two metric spaces, and let Y be a metric vector space and C be a pointed closed convex cone in Y with nonempty interior intC; the zero element in Y is denoted by θ. Let A be a nonempty subset of X and F be a vector-valued mapping from A × A into Y. A vector equilibrium problem, in short (VEP), is described as:

Find x ∊ A such that \(F(x,y) \notin - C\backslash \{ \theta \}\), for all y ∊ A

A point x ∊ A is said to be an efficient solution to (VEP) if

$$F(x,y) \notin - C\backslash \{ \theta \} ,{\text{ for all}}\;y \in A$$

When the subset A of X and the function F are perturbed by the parameter λ ∊ Λ, where Λ ⊂ Z, a parametric vector equilibrium problem, in short (PVEP), is a problem as following:

$${\text{Find}}\;x \in A\left( \lambda \right){\quad\text{such that}}\;F(x,y,\lambda ) \notin - C\backslash \{ \theta \} ,{\text{ for all}}\;y \in A\left( \lambda \right)$$

where \(A:\varLambda \to 2^{X} \backslash \{ \phi \}\) is a set-valued mapping, and F:B × B × Λ ⊂ X × X × Z → Y is a vector-valued mapping with A(Λ) = \(\cup\)  λΛ A(λ) ⊂ B.

A point x ∊ A(λ) is said to be an efficient solution to (PVEP) if

$$F(x,y,\lambda ) \notin - C\backslash \{ \theta \} ,{\text{ for all}}\;y \in A\left( \lambda \right)$$

In this work, we consider (PVEP) with cone C being also perturbed by parameter λ ∊ Λ, described as follows:

$${\text{Find}}\;x \in A\left( \lambda \right)\quad{\text{such that}}\;F(x,y,\lambda ) \notin - C(\lambda )\backslash \{ \theta \} ,{\text{ for all}}\;y \in A\left( \lambda \right)$$

where, for each λ ∊ Λ, C(λ) is a pointed closed convex cone in Y with nonempty interior, that is to say, C:Λ → 2Y is a cone-valued mapping. In this case, we call the (PVEP) as parametric vector order-perturbed equilibrium problem, in short (PVOPEP).

A point x ∊ A(λ) is called an efficient solution to (PVOPEP) if

$$F(x,y,\lambda ) \notin - C(\lambda )\backslash \{ \theta \} ,{\text{ for all}}\;y \in A\left( \lambda \right)$$

The set of efficient solutions to (PVOPEP) is denoted by S(λ), i.e.,

$$S(\lambda ): = \{ x \in A(\lambda )|F(x,y,\lambda ) \notin - C(\lambda )\backslash \{ \theta \} ,\forall y \in A(\lambda )\}$$

It is easy to see that S is a set-valued mapping S:Λ → 2X. Throughout this work, we always assume that S(λ) ≠ ϕ; for all λ ∊ Λ. Next, we recall some basic definitions and their properties which will be needed in the following.

B X (λδ) denotes the open ball with center λ and radius δ > 0 in a metric space X, d X (·, ·) denotes the distance in X, and the distance from x to the set A ⊂ X is denoted by d X (xA).

Definition 2.1 ([17])

A set-valued mapping S: Λ → 2X is said to be

  1. 1.

    lower semicontinuous (l.s.c.) at λ 0 ∊ Λ if for any open set V satisfying V ∩ S(λ 0) ≠ ϕ, there exists δ > 0 such that for every λ ∊ B Λ (λ 0δ),V ∩ S(λ) ≠ ϕ;

  2. 2.

    upper semicontinuous (u.s.c.) at λ 0 ∊ Λ if for any open set V satisfying S(λ 0) ⊂ V, there exists δ > 0 such that for every λ ∊ B Λ (λ 0δ),S(λ) ⊂ V;

  3. 3.

    l.s.c.(resp.,u.s.c.) on Λ if it is l.s.c.(resp.,u.s.c.) at each λ ∊ Λ;

  4. 4.

    continuous on Λ if it is both l.s.c. and u.s.c. on Λ.

Proposition 2.1 ([18, 19])

  1. 1.

    S:Λ → 2X is l.s.c. at λ 0 ∊ Λ if and only if for any sequence {λ n } ⊂ Λ with λ n  → λ 0 and any x 0 ∊ S(λ 0), there exists x n  ∊ S(λ n ) such that x n  → x 0.

  2. 2.

    If S has compact values (i.e., S(λ) is a compact set for each λ ∊ Λ), then S is u.s.c. at λ 0 ∊ Λ if and only if for any sequence {λ n } ⊂ Λ with λ n  → λ 0 and for any x n  ∊ S(λ n ), there exist x 0 ∊ S(λ 0) and a subsequence \(\{ x_{{n_{k} }} \}\) of {x n } such that \(x_{{n_{k} }} \to x_{0}\).

Definition 2.2

A vector-valued mapping f: X → Y is called cone lower semicontinuity (c.l.s.c.) at x 0 ∊ X if for each open set V of f(x 0), there exists a neighborhood U of x 0, such that f(x) ⊂ V + C, for all x ∊ U, where C ⊂ Y is a cone.

Definition 2.3

Let Λ be a topology space, Y be a topology vector space, and C:Λ → 2Y be a cone-valued mapping, if for every λ ∊ Λ, C(λ) is a closed convex pointed cone in Y. The closed unit ball with center θ in Y is denoted by B Y (θ). We call the cone-valued mapping C is an upper semicontinuous cone-valued mapping, if for each λ ∊ Λ and each open set Uin Y with U ⊃ C(λ) ∩ B Y (θ), there exists an open set V of λ such that U ⊃ C(λ ) ∩ B Y (θ) for every λ  ∊ V.

The main results

In this section, we present the lower semicontinuity of the solution mapping to (PVOPEP).

Theorem 3.1.

Suppose that the following conditions are satisfied:

  1. A(·) is continuous with compact values on Λ.

  2. F(·, ·, ·) is c.l.s.c. on B × B × Λ.

  3. C(·) is an upper semicontinuous cone-valued mapping on Λ.

  4. If \(A(\lambda )\backslash S(\lambda ) \ne \phi\) for each λ ∊ Λ, then for each λ ∊ Λ,for each \(x \in A(\lambda )\backslash S(\lambda )\), there exist y ∊ S(λ) and a positive function M:Λ → (0, + ∞) which is upper semicontinuous on Λ, such that

$$d_{X} (x,y) \le M(\lambda ) \cdot d_{Y} (F(x,y,\lambda ),Y\backslash - \text{int} C(\lambda ))$$

Then, S(·) is l.s.c. on Λ.

Proof

Suppose to the contrary that there exists λ 0 ∊ Λ such that S(·)is not l.s.c. at λ 0. Then, there exists a sequence {λ n } ⊂ Λ with λ n  → λ 0 and x 0 ∊ S(λ 0) with some open set V 1 of x 0, such that for any x n  ∊ S(λ n ), x n  ∉ V 1.

From x 0 ∊ S(λ 0), we have x 0 ∊ A(λ 0) and

$$F(x_{0} ,y,\lambda_{0} ) \notin - C(\lambda_{0} )\backslash \{ \theta \} , \quad \forall y \in A(\lambda_{0} )$$
(1)

Since A(·) is l.s.c. at λ 0, there exists a sequence {x n } ⊂ A(λ n ) such that x n  ∊ V 1. Then, for the above open set V 1, there exists a positive integer N; such that x n  ∊ V 1, for all n ≥ N. Obviously, we have \(x_{n} \in A(\lambda_{n} )\backslash S(\lambda_{n} )\) for all n ≥ N. For the sake of convenience, we consider n as still from one to infinity. By ④, for each \(x_{n} \in A(\lambda_{n} )\backslash S(\lambda_{n} )\), there exist y n  ∊ S(λ n ) and a positive function M:Λ → (0, + ∞) which is upper semicontinuous on Λ, such that

$$d_{X} (x_{n} ,y_{n} ) \le M(\lambda_{n} ) \cdot d_{Y} (F(x_{n} ,y_{n} ,\lambda_{n} ),Y\backslash - \text{int} C(\lambda_{n} ))$$
(2)

Since y n  ∊ A(λ n ), it follows from the upper semicontinuity and compactness of A(·) at λ 0 that there exist y 0 ∊ A(λ 0) and a subsequence \(\{ y_{{n_{i} }} \}\) of {y n } such that \(y_{{n_{i} }} \to y_{0}\). In particular, from (2), we have

$$d_{X} (x_{{n_{i} }} ,y_{{n_{i} }} ) \le M(\lambda_{{n_{i} }} ) \cdot d_{Y} (F(x_{{n_{i} }} ,y_{{n_{i} }} ,\lambda_{{n_{i} }} ),Y\backslash - \text{int} C(\lambda_{{n_{i} }} ))$$
(3)

Since the distance function d(·, ·) is continuous, F(·, ·, ·) is c.l.s.c., M(·) is u.s.c., and C(·) is an upper semicontinuous cone-valued mapping, then let i → + ∞ on both sides of (3), we have

$$d_{X} (x_{0} ,y_{0} ) \le M(\lambda_{0} ) \cdot d_{Y} (F(x_{0} ,y_{0} ,\lambda_{0} ),Y\backslash - \text{int} C(\lambda_{0} ))$$
(4)

If x 0 ≠ y 0, by (4), we can obtain

$$M(\lambda_{0} ) \cdot d_{Y} (F(x_{0} ,y_{0} ,\lambda_{0} ),Y\backslash - \text{int} C(\lambda_{0} )) \ge d_{X} (x_{0} ,y_{0} ) > 0$$

From M(λ 0) > 0, we have

$$d_{Y} (F(x_{0} ,y_{0} ,\lambda_{0} ),Y\backslash - \text{int} C(\lambda_{0} )) > 0$$

Thus, we have

$$F(x_{0} ,y_{0} ,\lambda_{0} ) \in - \text{int} C(\lambda_{0} ))$$

which contradicts (1) as we see by taking y = y 0. Therefore x 0 = y 0. This is impossible by the contradiction assumption. Thus, the proof is complete.\(\square\)

Remark 3.1

The following examples indicate that the assumption ④ in Theorem 3.1 in our work (or the assumption (iii) of Theorem 3.1 in [15]) cannot be applied to the case when \(A(\lambda )\backslash S(\lambda ) = \phi\), for some λ ∊ Λ. So the assumption ④ of Theorem 3.1 in our paper (or the assumption (iii) of Theorem 3.1 in [15])is not essential.

Example 3.1

Let X = Z = R,\(\varLambda_{1} = [\frac{1}{4},\frac{2}{3}]\), Λ 2 = [2, 3], A(λ) = B = [0, 1], Y = R 2, C(λ) = R 2+ and F(xyλ) = (λ(y − x), λ(y − x)). It follows from a direct computation that

$$S_{ 1} \left( \lambda \right) = \left\{ 0 \right\}, \forall \lambda \in \varLambda_{ 1} \;{\text{and}}\;S_{ 2} \left( \lambda \right) = \left\{ 0 \right\}, \forall \lambda \in \varLambda_{ 2}$$

For each λ ∊ Λ 1 ∪ Λ 2, for every \(x \in A(\lambda )\backslash S(\lambda ) = (0,1]\), taking y = 0 ∊ S(λ); we have

$$d_{X} \left( {x, y} \right) = x\;{\text{and}}\;d_{Y} (F(x,y,\lambda ),Y\backslash - \text{int} C(\lambda )) = \lambda x$$

Obviously,

$$d_{X} (x,y) \ge d_{Y} (F(x,y,\lambda ),Y\backslash - \text{int} C(\lambda )),\forall \lambda \in \varLambda_{1}$$
$$d_{X} (x,y) \le d_{Y} (F(x,y,\lambda ),Y\backslash - \text{int} C(\lambda )),\forall \lambda \in \varLambda_{2}$$

From above two inequalities, it easy to see that the assumption (iii) in Theorem 3.1. in [15] is violated when λ ∊ Λ 1. However, S 1(·) and S 2(·) are all continuous on Λ 1 and Λ 2, respectively. If we take M: Λ 1 → (0, + ∞), defined by \(M(\lambda ) = 4,\forall \lambda \in \varLambda_{1} = \left[ {\frac{1}{4},\frac{2}{3}} \right]\), then

$$d_{X} (x,y) \le M(\lambda ) \cdot d_{Y} (F(x,y,\lambda ),Y\backslash - \text{int} C(\lambda )),\forall \lambda \in \varLambda_{1}$$

Thus, the example 3.1 satisfies all the assumptions of Theorem 3.1. in our work, and then, it is obtained that S(·) is l.s.c. on Λ.Consequently, Theorem 3.1. in our work is real extension from Theorem 3.1. in [15].□

Example 3.2

Let X = Y = R, C(λ) = R +, Λ = (0, 1], A(λ) = B = [λ 2, 1 + λ] and F(xyλ) = λ(y − x). It follows from a direct computation that S(λ) = {λ 2}, ∀λ ∊ Λ. And it is easy to check that S(·) is continuous on Λ. For any λ ∊ (0, 1], for each \(x \in A(\lambda )\backslash S(\lambda ) = (\lambda^{2} ,1 + \lambda ]\), taking the unique element y = λ 2 ∊ S(λ), we have

$$x - \lambda^{2} = d_{X} (x,y) \ge d_{Y} (F(x,y,\lambda ),Y\backslash - \text{int} C(\lambda )) = \lambda (x - \lambda^{2} )$$

Obviously, the assumption (iii) of Theorem 3.1. in [15] is violated, but if taking M: Λ → (0, + ∞) as following:

\(M(\lambda ) = \frac{a}{\lambda },\forall \lambda \in \varLambda\) where a is a constant number and a ≥ 1.

Thus, the example 3.2 satisfies all the assumptions of Theorem 3.1. in our work, and it follows from Theorem 3.1. in our work that S(·) is l.s.c. on Λ. But the Theorem 3.1. in [15] is invalid.

Example 3.3

Let X = Y = Z = R, C(λ) = R +, Λ = [0, 1], A(λ) = B = [1 − λ 2, 1 + λ 2] and F(xyλ) = x(1 + λ − y).

It follows from a direct computation that S(λ) = [1 − λ 2, 1 + λ 2] = A(λ). For any λ ∊ [0, 1], \(A(\lambda )\backslash S(\lambda ) = \phi\). Obviously, we cannot take any \(x \in A(\lambda )\backslash S(\lambda )\). So the condition (iii) of Theorem 3.1 in [15] (or the assumption ④ in Theorem 3.1 in our work) cannot be applied. But it is easy to check that S(·) is continuous on Λ.

Our approach can also be applied to study the lower semicontinuity of the weak solution mappings. A point x ∊ A(λ) is called a weak efficient solution to (PVOPEP) if

$$F(x,y,\lambda ) \notin - \text{int} C(\lambda ),\forall y \in A(\lambda )$$

The set of weak efficient solutions to (PVOPEP) is denoted by S W (λ), i.e.,

$$S_{W} (\lambda ): = \{ x \in A(\lambda )|F(x,y,\lambda ) \notin - \text{int} C(\lambda ),\forall y \in A(\lambda )\}$$

We can also obtain the following theorem on the lower semicontinuity of the weak efficient solution map to (PVOPEP) with a trivial adaptation of the proof.

Theorem 3.2

Suppose that the following conditions are satisfied:

  1. A(·) is continuous with compact values on Λ.

  2. F(·, ·, ·) is c.l.s.c. on B × B × Λ.

  3. C(·) is an upper semicontinuous cone-valued mapping on Λ.

  4. If \(A(\lambda )\backslash S_{W} (\lambda ) \ne \phi\); for each λ ∊ Λ, then for each λ ∊ Λ,for each \(x \in A(\lambda )\backslash S_{W} (\lambda )\), there exist y ∊ S W (λ) and a positive function M:Λ → (0, + ∞) which is upper semicontinuous on Λ, such that

$$d_{X} (x,y) \le M(\lambda ) \cdot d_{Y} (F(x,y,\lambda ),Y\backslash - \text{int} C(\lambda ))$$

Then, S W (·) is l.s.c. on Λ.