Chen et al. Fixed Point Theory and Applications 2011, 2011:36 Fixed Point Theory and Applications

http://www.fixedpointtheoryandapplications.eom/content/2011/1/36 a SpringeiOpen Journal

RESEARCH

Open Access

Connectedness of approximate solutions set for vector equilibrium problems in Hausdorff topological vector spaces

Bin Chen1, Qing-you Liu2, Zhi-bin Liu3 and Nan-jing Huang1

* Correspondence: nanjinghuang@hotmail.com department of Mathematics, Sichuan University, Chengdu, Sichuan 610064, P.R. China Full list of author information is available at the end of the article

Abstract

In this paper, a scalarization result of e-weak efficient solution for a vector equilibrium problem (VEP) is given. Using this scalarization result, the connectedness of e-weak efficient and e-efficient solutions sets for the VEPs are proved under some suitable conditions in real Hausdorff topological vector spaces. The main results presented in this paper improve and generalize some known results in the literature.

Keywords: vector equilibrium problem, scalarization method, £-weak efficient solution, ^-efficient solution, connectedness

1 Introduction

Let K be a nonempty subset of a real Hausdorff topological vector space E, and f: K x K ® R a bifunction such that fx, x) > 0 for all x e K. Then, the scalar equilibrium problem consists in finding xe K such that

f (XX, y) > 0, Vy e K.

It provides a unifying framework for many important problems, such as optimization problems, variational inequality problems, complementary problems, minimax inequality problems, Nash equilibrium problems, and fixed point problems, and has been widely applied to study problems arising in economics, mechanics, and engineering science (see [1]). On the other hand, several operations research problems are formulated with a multicriteria consideration. These are vector optimization problems, vector variational inequality and complementarity problems and vector equilibrium problems (VEPs). Recently, the VEP has received much attention by many authors because it provides a unified model including vector optimization problems, vector variational inequality problems, vector complementarity problems and vector saddle point problems as special cases (see, for example, [2-24] and the references therein).

It is well known that another important problem for VEPs is to study the topological properties of solutions set. Among its topological properties, the connectedness is of interest. Recently, Lee et al. [25], Cheng [26] have studied the connectedness of weak efficient solutions set for vector variational inequalities in finite dimensional Euclidean space. Gong [27-29] has studied the connectedness of the various solutions set for VEPs in infinite dimension space. Chen et al. [30] studied the connectedness and the

SpringerOpen0

© 2011 Chen et al; licensee Springer. 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.

compactness of the weak efficient solutions set for set-valued VEPs and the set-valued vector Hartman-Stampacchia variational inequalities in normed linear space. Gong and Yao [31] have studied the connectedness of the set of efficient solutions for generalized systems. Zhong et al. [32] have studied the connectedness and path-connectedness of solutions set for symmetric VEPs. However, the connectedness of approximate solutions set for VEPs remained unstudied.

In this paper, we show a scalarization result of e-weak efficient solution for a VEP. Using this scalarization result, we discuss the connectedness of e-weak efficient and e-efficient solutions sets for VEPs under some suitable conditions in real Hausdorff topological vector spaces. The main results presented in this paper generalize some known results due to Gong [27] and Gong and Yao [31].

2 Preliminaries

Throughout this paper, let X and Y be two real Hausdorff topological vector spaces and A a nonempty subset of X. Let F : A x A ® Y be a mapping and C be a closed convex pointed cone in Y. The cone C induces a partial ordering in Y, defined by

z1 < z2 if and only if z2 — zi e C.

C = {f e : f (y) > 0 for all y e C}

be the dual cone of C.

Denote the quasi-interior of C* by C#, that is,

CC = {f e : f (y) > 0 for all y e C\{0}}.

Let D be a nonempty subset of Y. The cone hull of D is defined as

cone (D) = {td : t > 0, d e D}.

A nonempty convex subset B of the convex cone C is called a base of C if

C = cone (B) and 0 £ cl(B).

It is easy to see that C# * 0 if and only if C has a base.

Throughout this paper, we always assume that intC * 0. Let e be a fixed point in intC and we set

C = {f e C*\{0} : f (e) =1}, C" = {f e C : f (e) = 1}.

Now, we give the concepts of e-weak efficient solution, e-efficient solution, and e-f efficient solution for the VEP.

Definition 2.1. A vector x e A satisfying

F(x, y) e —intC — ee for all y e A,

is called a e-weak efficient solution to the VEP. Denote by Ve-W (A, F) the set of all e-weak efficient solutions to the VEP.

Definition 2.2. A vector x e A satisfying

F(x, y) e —C\{0} — ee for all y e A,

is called a e-efficient solution to the VEP. Denote by Ve (A, F) the set of all e-efficient solutions to the VEP.

Definition 2.3. Letf e C*\{0}. A vector x e A is called a e-f efficient solution to the VEP if

f (F(x, y)) >—e for all y e A,

Denote by Vef (A, F) the set of all e-f efficient solutions to the VEP. Definition 2.4. [33] Let G be a set-valued map from a topological space W to another topological space Q. We say that G is

(i) upper semicontinuous at x0 e W if, for any neighborhood U(G(x0)) of G(x0), there is a neighborhood U (x0) of x0 such that G(x) c U (G(x0)) for all x e U(x0);

(ii) upper semicontinuous on W if it is upper semicontinuous at each x e W

(iii) lower semicontinuous at x0 e W if, for any net {xa : a e I} converging to x0 and for any y0 e G(x0), there exists a net ya e G(xa) that converges to y0;

(iv) lower semicontinuous on W if it is lower semicontinuous at each x e W;

(v) continuous on W if it is both upper semicontinuous and lower semicontinuous on W;

(vi) closed if Graph(G) = {(x, y) : x e W, y e G(x)} is a closed subset in W x Q. 3 Scalarization

Lemma 3.1. Suppose F (x, A) + C is a convex set for each x e A. Then,

Ve—W(A, F) = UfeC Ve—f (A, F).

Proof. We first prove that

UfeC Ve—f (A, F) c Ve—w(A, F).

In fact, letting X0 e (JfeC Ve—f (A, F), then there existsf e C,

f (F(x0, y)) > —e, for all y e A. (3.1)

We claim that x0 e Ve-W (A, F). If not, then there exists y0 e A such that F (x0, y0) e -intC - ee. Thus, we have

f (F(x0, y0) + ee) < 0 and so

f(F(x0, y0)) < —f(ee) = —e,

which is a contradiction to (3.1). We next prove that

Ve—w(A, F) c f Ve—f (A, F).

Let x e Ve-W (A, F). Then, F (x, A) n (-intC - ee) = 0. Since C is a pionted convex cone, we have

(F(x, A) + C + ee) n (—intC) = 0.

By assumption, we know that F (x, A) + C is a convex set. Using the separation theorem for convex sets, there exists some g e Y *\{0}, such that

inf{g (F(x, y) + c + ee) : y e A, c e C}> sup {g (—c) : c e C}. (3.2)

From (3.2), we get g e C*\{0} and so g(F(x, y)) > -g(ee) for all y e A,

where e e intC with g (e) >0. Letting / = ^Jy then/ (F (x, y)) > -e, for all y e A and f (e) = 1. Thus, f e C and so

x eUfeC Ve-f A F).

This completes the proof.

Remark 3.1 When s = 0, it is easy to see that

Ve-W(A, F) = UfeC Ve-f(A F) = UfeC\{0} ^(A, F).

Therefore, Lemma 3.1 generalizes Lemma 2.1 in [27]. 4 Existence of the solutions

Definition 4.1. The bifunction F : A x A ® Y is concave-like with respect to the first variable, if for t e [0, 1], the following condition is satisfied: For x1, x2 e A, there exists x3 e A, such that

F(x3, y) e tF(xi, y) + (1 — t)F(x2, y) + C, for all y e A.

The bifunction F : AxA ® Y is convex-like with respect to the second variable, if for t e [0, 1], the following condition is satisfied: for y2 e A, there exists y3 e A, such that

F(x, y3) e tF(x, y1) + (1 — t)F(x, y2) — C, for all x e A.

Theorem 4.1. Let A be a nonempty compact subset of X, and f e C'. Assume that the following conditions are satisfied:

(i) F (x, x) e C - se, for all x e A;

(ii) F: A x A ® Y is concave-like with respect to the first variable and convex-like with respect to the second variable;

(iii) For each fixed y e A, the function x ^f (F (x, y)) is upper semicontinuous on A. Then, Vsf (A, F) * 0.

Proof. Define the set-valued map G : A ® 2A by G(y) = {x e A, f (F(x, y)) > —e}

By assumption, y e G (y), for all y e A, so G (y) * 0. By assumption, we can see that G (y) is a closed subset of A. Next, we prove that n{G (y) : y e A} * 0. Since A is a

compact, we need to show that f|G(y<)= 0 any arbitrary chosen yi,..., yn in A.

Suppose it is not true. Then, there exists a set B = {y1,..., yn} c A such that

Pi G(yi) = 0. Thus, for any x e A, there exists y; e B such that x € G (y;). It follows

f (F(x, yi)) + e < 0

and so there exists hi >0 such that

f (F(x, yi)) + e < — ni, i =1,2, ..., n.

Since x f (F (x, y)) is upper semicontinuous on A, we can choose h >0 such that, for any x e A, there exists yi e B satisfying

f(F(x, yi)) + e + n < 0.

Define g : A ® Rn by

g(x) = (—f (F(x, y1)) — e — n, —f (F(x, y2)) — e — n,..., —f (F(x, yn)) — e — n),

where x e A. We get

g(x) £ intR+, for all x e A. (4.1)

Since f e C and F (x, y) is concave-like with respect to the first variable, we can see that, for t e [0, 1], x1, x2 e A, there exists x3 e A such that

g(x3) e tg(x1) + (1 — t)g(x2) — C.

This shows that g(A) + R+ is a convex set. It follows from (4.1) that

0 e g(A) + intR.

By the separation theorem of convex sets (see, for example, [34]), we can find t1,..., tn

> 0 with J2 ti = 1 such that

0 < ti(—f (F(x, yi)) — e — n), for all x e A.

It follows that

tif (F(x, yi)) <— e — n, for all x e A.

By assumption, there exists y e A such that

F(x, y) ti(F(x, yi)) — C, for all x e A.

Since f e C', we have

f (F(x, y)) < f ^^^ ti(F(x, yi)) j , for all x e A. Sof (F (x, y)) < -e - h <-e, for all x e A. Setting x = y, it follows that

y)) < —e.

On the other hand, by the assumption, f(F(y, y)) > —

This is a contradiction. Therefore, n{G (y) : y e A} * 0, and so there exists x e n{G (y) : y e A}. This means that Vef (A, F) * 0. This completes the proof.

5 Connectedness of the solutions set

In this section, we discuss the connected results of e-weak efficient solutions set and e-efficient solutions set.

Definition 5.1. Let A be a convex set. The bifunction F : A x A ® Y is C-concave with respect to the first variable, if for t e [0, 1], xi, x2 e A,

F(tx! + {1 - t)x2, y) e tF(xlf y) + (1 - t)tF(x2, y) + C.

It is clear that when A is a convex set, F : AxA ® Y is C-concave with respect to the first variable, then it is concave-like about the first variable.

Theorem 5.1 Let A be a nonempty compact convex swbset of X, and f e C". Asswme that the following conditions are satisfied.

(i) F (x, x) e C - ee, for all x e A;

(ii) F : A x A ® Y is C-concave with respect to the first variable and convex-like with respect to the second variable;

(iii) For each fixed y e A, thefUnction x f (F (x, y)) is upper semicontinwows on A;

(iv) D = {F (x, y) : x, y e A} is a bownded set of Y.

Then, Ve-W (A, F) is a connected set.

Proof. Define a set-valued mapping H : C ® 2A by

H(f) = Ve-f (A, F), f e C.

By Theorem 4.1, we know that, for each f e C', Vef (A, F) * 0. It is easy to see that C is a convex set and so is connected. Next, we prove that, for each f e C', H f) is a connected set. Let x1, x2 e H (f), we have x1, x2 e A , and

f (F(xi, y)) > -e, Vy e A, i = 1,2. (5.1)

Because F : A xA ® Y is C-concave with respect to the first variable, for each fixed y e A, t e [0, 1],

F(txi + (1 - t)x2, y) e tF(xi, y) + (1 - t)F(x2, y) + C. Hence

tf(F(x1, y)) + (1 - t)f(F(x2, y)) < f(F(tx1 + (1 - t)x2, y)). It follows from (5.1) that

f (F(tx1 +(1 - t)x2, y)) > -e. Hence

tx1 + (1 - t)x2 e H(f) and so H f) is a convex set. Thus, it is a connected set.

Next, we show that H is upper semicontinuous on C. Since A is compact, we only need to show that H is closed. Let {fa, xa) : a e I} с Graph (H) be a net such that fa, xa) ® (/, x), where fa ® f means that {/a} converges to f with respect to the strong topology b (Y*, Y) in Y*. Since C is a closed set and A is a compact set, we know that (f x) e C x A. From xa e H (fa) = Ve- fa (A, F), we have

fa (F(xa, y)) > —e. (5.2)

For any 8 >0,

U = jy* e Г : sup |y+(u)| < s|

[ ueD J

is a neighborhood of 0 with respect with to b (Y *, Y). Since fa ® f there exists a0 e I such thatfa - f e U, for all a > a0. It follows that

sup |(fa — f )(u)| < S, whenever a > a0.

Therefore, for any y e A,

|(fa — f )(F(Xa, y))| < S, whenever a > a0

and so

lim(fa(F(xa, y)) — f (F(xa, y))) = 0, for all y e A. (5.3)

Because x f (F (x, y)) is upper semicontinuous on A, then

lim supf(F(xa, y)) < f (F(x, y)). (5.4)

From (5.2), (5.3) and (5.4), we have

—e < limsupfa (F(Xa, y))

< lim(fa(F(xa, y)) — f (F(xa, y))) + lim sup f (F(Xa, y))

< f(F(x, y)).

Hence, x e H f) = V£-f (A, F). By Theorem 3.1 in [35], Ufeo ve—f (A, F) is a connected set. Because F : A x A ® Y is convex-like with respect to the second variable, we have F (x, A) + C is a convex set, by Lemma 3.1,

Ve—W (A, F) = Ц eC, Ve—f (A, F)

is a connected set. This completes the proof.

Next, we give an example to illustrate Theorem 5.1.

Example 5.1 Let X = R, Y = R2, C = R+ = {(x1, x2) : x1 > 0, x2 > 0}, e = 2, e = (2, 3), and A = [0, 2]. Lei

F(x, y) = (y — x2 — 2, y — x2 — 4), Vx, y e A.

Then, F satisfies a// conditions of Theorem 5.1. It is easy to see that F) = </2]- Clearly, VE.W (A, F) is a nonempty connected set.

Definition 5.2. The bifunction F : A xA ® Y is e-C strictly monotone if, for any x, y

e A, x ^ y,

F(x, y) + F(y, x) e —int C — 2ee.

Theorem 5.2 Suppose that a// conditions of Theorem 5.1 are satisfied and F : A x A ® Y is e-C strict/y monotone. Then, Ve-W (A, F) is a path connected set. Proof. Define the set-valued mapping H : C ® 21 by

By Theorem 4.1, we know that, for each f e C, Vef (A, F) * 0. Furthermore, because F : A x A ® Y is e-C strictly monotone, it is easy to see that, for eachf e C', H f) = Ve-f (A, F) is a single point set. From the proof of Theorem 5.1, we know that H is upper semicontinuous on C and so it is continuous on C. Since C is a convex set, so it is a path connected set. Hence,

is a path connected set. This completes the proof. Next, we give an example to illustrate Theorem 5.2.

Example 5.2 Let X = R Y = R2, C = R2 = {(x1, x2) : x1 > 0, x2 > 0}, s = -1, e = (1, 2), and A = [-1, 1]. Let

F(x, y) = (x(y — x) + 1, x(y — x) + 2), Wx, y e A.

Then, F satisfies all the conditions of Theorem 5.2. It is easy to see that Vs-W (A, F) = {0}. C/ear/y, Vs-W (A, F) is a nonempty path connected set.

Next, we give a lemma before we give the connectedness theorem of s-efficient solutions set.

Lemma 5.1. Suppose that all conditions of Theorem 5.2 are satisfied, then

Proof. By Theorem 4.1, we know that, for each f e C, Vs-f (A, F) * 0. By definition, we have

H(f) = Ve—f(A, F), f e CJ.

Vs—W (A, F) = H(C') = (J H(f) = U. C, Ve—f (A, F)

From Lemma 3.1, we have

By (5.5) and (5.6), we have

f Ve—f (A, F) c Ve (A, F) c U Ve—f (A, F).

Next, we prove that

Define the set-valued mapping: H: C ® 2A by H(f) = Ve—f (A, F), f e C'.

From Theorem 5.2, we know that H f) is a single-valued mapping, and H is continuous on C.

Let x e ljfeC Vs-f (A, F). Then, there exists f e C', such that

(xj = Ve_f (A, F) = H(f).

Let g e C', and set

Then, f e C# and f (e) = 1. Thus, f e C'.

Next, we show that {f,} converges tof with respect to the topology b (Y*, Y). For any neighborhood of 0 with respect to b (Y*, Y), there exist bounded subsets B e Y (i = 1, 2,..., m) and ^ >0 such that

p| f e Y* : sup |f(y)| <8\ c U.

U' I yeBi J

Since B is bounded and g -f e Y*, it is easy to see that |(g -f) (B;)| is bounded for i = 1, 2,..., m. This implies that there exists N such that

<8, i = 1,2,..., m; n > N.

Hence, l(g —f)eU, that is/,, -/e U. Hence, converges to/with respect to b (Y*, Y).

Since H is continuous onf we have H (fn) ® H f). Set {xn} = H fn), then (Xnj = Hfn) = Vs-fn(A, F) c |Jf^ Vs-f(A, F).

Because {x} = H (f), we have Xn ^ X. This implies that

^(UfeC» V«"f (A, F)).

Since x e (JfeC Ve-f (A, F) is arbitrary, we have

UfeC (A, F) c cl(\JfeC„ Vs-f (A, F)) .

Therefore,

f V.-f(A, F) c VS(A, F) c c^UfeC. V.-f(A, F)j . This completes the proof.

Theorem 5.3. Suppose that all the conditions of Theorem 5.2 are satisfied. Then, V (A, F) is a connected set. Proof. By Lemma 5.1, we have

UfeC„ V— (A, F) c Ve(A, F) c cl(\JfeC„ Ve_f(A, F)) . (5.7)

From Theorem 5.2, we can get

UfeC" Ve—f(A, F)

is connected set and so (5.7) implies that Vs (A, F) is a connected set. This completes the proof. Remark 5.1 When s = 0, we can get

UfeC» Ve—f (A, F) = ^—Jfec= Ve—f (A F)

Therefore, Theorem 5.3 generalizes Theorem 2.2 in [31]. Next, we give an example to illustrate Theorem 5.3.

Example 5.3 Let X = R Y = R C = R+, s =1, e = 1, and A = [1, 2]. Let F (x, y) = x (y - x) - 1 for a// x, y e A. Then, it is easy to check that a// the conditions of Theorem 5.3 are satisfied and

Ve(A, F) = {1}. C/ear/y, Vs (A, F) is a nonempty connected set.

Abbreviations

VEP: vector equilibrium problem. Acknowledgements

This work was supported by the NationalNaturalScience Foundation of China (50874096, 70831005) and the Open Fund (PLN0904) of State Key Laboratory of Oiland Gas Reservoir Geology and Exploitation (Southwest Petroleum University).

Author details

department of Mathematics, Sichuan University, Chengdu, Sichuan 610064, P.R. China 2State Key Laboratory of Oil and Gas Reservoir Geology and Exploitation, Southwest Petroleum University, Chengdu, Sichuan 610500, PR China 3Department of Applied Mathematics, Southwest Petroleum University, Chengdu, 610500, PR China

Authors' contributions

BC carried out the study of connectedness of E-weak efficient and E-efficient solutions sets for VEPs and drafted the manuscript. Q-YL participated in the design of the study. Z-BL gave some examples to show the main results. N-JH conceived of the study, and participated in its design and coordination. Allauthors read and approved the final manuscript.

Competing interests

The authors declare that they have no competing interests.

Received: 27 October 2010 Accepted: 15 August 2011 Published: 15 August 2011 References

1. Blum, B, Oettli, W: From optimzation and variational inequalities to equilibrium problems. Math. Stud. 63, 123-145 (1994)

2. Chen, GY, Huang, XX, Yang, XQ: Vector Optimization: Set-Valued and Variational Analysis. Springer, Berlin (2005)

3. Giannessi, F, (ed): Vector Variational Inequilities and Vector Equilibria: Mathematical Theories. Kluwer, Dordrechet (2000)

4. Ansari, QH, Flores-Bazan, F: Recession methods for generalized vector equilibrium problems. J Math Anal Appl. 321, 132-146 (2006). doi:10.1016/j.jmaa.2005.07.059

5. Ansari, QH, Oettli, W, Schläger, D: A generalization of vector equilibrium. Math Methods Oper Res. 46, 147-152 (1997). doi:10.1007/BF01217687

6. Ansari, QH, Yao, JC: An existence result for the generalized vector equilibrium problem. Appl. Math. Lett. 12, 53-56 (1999)

7. Chen, B, Gong, XH: Continuity of the solution set to parametric set-valued weak vector equilibrium problems. Pacific J. Optim. 6, 511-520 (2010)

8. Chen, CR, Li, SJ, Teo, KL: Solution semicontinuity of parametric generalized vector equilibrium problems. J. Glob. Optim. 45, 309-318 (2009). doi:10.1007/s10898-008-9376-9

9. Konnov, IV, Yao, JC: Existence of solutions of generalized vector equilibrium problems. J. Math. Anal. Appl. 233, 328-335 (1999). doi:10.1006/jmaa.1999.6312

10. Fu, JY: Generalized vector quasivariational problems. Math. Methods Oper. Res. 52, 57-64 (2000). doi:10.1007/ s001860000058

11. Hou, SH, Yu, H, Chen, GY: On vector quasi-equilibrium problems with set-valued maps. J. Optim. Theory Appl. 119, 139-154 (2003)

12. Tan, NX: On the existence of solutions of quasi-variational inclusion problems. J. Optim. Theory Appl. 123, 619-638

(2004). doi:10.1007/s10957-004-5726-z

13. Peng, JW, Joseph Lee, HW, Yang, XM: On systems of generalized vector quasi-quilibrium problem with set-valued maps. J. Glob. Optim. 35, 139-158 (2006)

14. Lin, LJ, Ansari, QH, Huang, YJ: Some existence results for solutions of generalized vector quasi-equilibrium problems. Math. Methods Oper. Res. 65, 85-98 (2007). doi:10.1007/s00186-006-0102-4

15. Long, XJ, Huang, NJ, Teo, KL: Existence and stability of solutions for generalized strong vector quasi-equilibrium problem. Math. Comput. Model. 47, 445-451 (2008). doi:10.1016/j.mcm.2007.04.013

16. Huang, NJ, Li, J, Yao, JC: Gap functions and existence of solutions for a system of vector equilibrium problems. J. Optim. Theory Appl. 133, 201-212 (2007). doi:10.1007/s10957-007-9202-4

17. Li, J, Huang, NJ: Implicit vector equilibrium problems via nonlinear scalarisation. Bull. Aust. Math. Soc. 72, 161-172

(2005). doi:10.1017/S000497270003495X

18. Li, J, Huang, NJ, Kim, JK: On implicit vector equilibrium problems. J. Math. Anal. Appl. 283, 501 -512 (2003). doi:10.1016/ S0022-247X(03)00277-4

19. Park, S: Fixed points of better admissible maps on generalized convex spaces. J. Korea Math. Soc. 37(6), 885-899 (2000)

20. Park, S: Equilibrium existence theorems in KKM spaces. Nonlinear Anal. TMA. 69, 4352-4364 (2008). doi:10.1016/j. na.2007.10.058

21. Park, S: Compact Browder maps and equilibria of abstract economies. J. Appl. Math. Comput. 26, 555-564 (2008). doi:10.1007/s12190-007-0022-3

22. Park, S: Remarks on fixed points, maximal elements, and equilibria of economies in abstract convex spaces. Taiwanese J. Math. 12, 1365-1383 (2008)

23. Park, S, Kim, H: Coincidence theorems for admissible multifunctions on generalized convex spaces. J. Math. Anal. Appl. 197, 173-187 (1996). doi:10.1006/jmaa.1996.0014

24. Park, S, Kim, H: Founditions of the KKM theory on generalized convex spaces. J. Math. Anal. Appl. 209, 551-571 (1997). doi:10.1006/jmaa.1997.5388

25. Lee, GM, Kim, DS, Lee, BS, Yen, ND: Vector variational inequality as a tool for studying vector optimization problems. Nonlinear Anal.: Theory, Methods Appl. 34, 745-765 (1998). doi:10.1016/S0362-546X(97)00578-6

26. Cheng, YH: On the connectedness of the solution set for the weak vector variational inequality. J. Math. Anal. Appl. 260, 1-5 (2001). doi:10.1006/jmaa.2000.7389

27. Gong, XH: Efficiency and Henig efficiency for vector equilibrium problems. J. Optim. Theory Appl. 108, 139-154 (2001). doi:10.1023/A:1026418122905

28. Gong, XH, Fu, WT, Liu, W: Super efficiency for a vector equilibrium in locally convex topological vector spaces. In: Giannessi F (ed.) Vector Variational Inequalities and Vector Equilibria: Mathematical Theories. pp. 233-252. Kluwer Academic Publishers, Netherlands (2000)

29. Gong, XH: Connectedness of the solution sets and scalarization for vector equilibrium problems. J. Optim. Theory Appl. 133, 151-161 (2007). doi:10.1007/s10957-007-9196-y

30. Chen, B, Gong, XH, Yuan, SM: Connectedness and compactness of weak efficient solutions set for set-valued vector equilibrium problems. J. Inequal. Appl 2008, 15 (2008). Article ID 581849

31. Gong, XH, Yao, JC: Connectedness of the set of efficient solutions for generalized systems. J. Optim. Theory Appl. 138, 189-196 (2008). doi:10.1007/s10957-008-9378-2

32. Zhong, RY, Huang, NJ, Wong, MM: Connectedness and path-connectedness of solution sets for symmetric vector equilibrium problems. Taiwan. J. Math. 13, 821-836 (2009)

33. Aubin, JP, Ekeland, I: Applied Nonlinear Analysis. Wiley, New York (1984)

34. Robertson, AP, Robertson, W: Topological Vector Spaces. Cambridge University Press (1964)

35. Warburton, AR: Quasi-concave vector maximization: connectedness of the sets of Pareto-optimal and weak Pareto-optimal alternatives. J. Optim. Theory Appl. 40, 537-557 (1983). doi:10.1007/BF00933970

doi:10.1186/1687-1812-2011-36

Cite this article as: Chen et al.: Connectedness of approximate solutions set for vector equilibrium problems in Hausdorff topological vector spaces. Fixed Point Theory and Applications 2011 2011:36.

Submit your manuscript to a SpringerOpen journal and benefit from:

7 Convenient online submission 7 Rigorous peer review 7 Immediate publication on acceptance 7 Open access: articles freely available online 7 High visibility within the field 7 Retaining the copyright to your article

Submit your next manuscript at 7 springeropen.com