CC BY
0Hindawi Publishing Corporation Abstract and Applied Analysis Volume 2014, Article ID 750709, 6 pages http://dx.doi.org/10.1155/2014/750709
Research Article
Existence and Well-Posedness for Symmetric Vector Quasi-Equilibrium Problems
Kaihong Wang, Wenyan Zhang, and Min Fang
School of Economic Mathematics, Southwestern University of Finance and Economics, Chengdu 610074, China Correspondence should be addressed to Kaihong Wang; wangkaihong@swufe.edu.cn Received 2 February 2014; Accepted 3 June 2014; Published 1 July 2014 Academic Editor: Qamrul Hasan Ansari
Copyright © 2014 Kaihong Wang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
An existence result for the solution set of symmetric vector quasi-equilibrium problems that allows for discontinuities is obtained. Moreover, sufficient conditions for the generalized Levitin-Polyak well-posedness of symmetric vector quasi-equilibrium problems are established.
1. Introduction
Well-posedness of optimization problems was first studied by Tykhonov [1] in 1966. Since then, the notion of well-posedness has been extended to different kinds of optimization problems (see [2-5]). In the book edited by Lucchetti and Revalski [6], Loridan gave a survey on some theoretical results of well-posedness, approximate solutions, and variational principles in vector optimization. Well-posedness for constrained optimization problems was first studied by Levitin and Polyak [7]. The study of Levitin-Polyak well-posedness for convex scalar optimization problems with functional constraints comes from [8]. Recently, this research was extended to general constrained vector optimization problems [9], generalized variational inequality problems with functional constraints [10], and vector equilibrium problems with functional constraints [11].
In 2003, Fu [12] introduced the symmetric vector quasi-equilibrium problem (for short (SVQEP)) and studied existence conditions of (SVQEP). (SVQEP) is a generalization of the equilibrium problem, proposed by Blum and Oettli [13], and a unified model of several problems, for example, vector optimization problems, problems of vector Nash equilibria, vector variational inequalities, and vector complementarity problems. Farajzadeh [14] considered existence theorem of the solution of symmetric vector quasi-equilibrium problems in the Hausdorff topological vector space and answered the open question raised by Fu [12]. In [15], Li et al. obtained
existence results for two classes of generalized vector quasi-equilibrium problems. Zhang [16] introduced generalized Levitin-Polyak well-posedness for (SVQEP) and obtained sufficient conditions for the generalized Levitin-Polyak well-posedness of (SVQEP).
In this paper, we will introduce existence and well-posed theorem of (SVQEP) for discontinuous vector-valued mapping, which extend the corresponding result in [12] in metric space. Then, by using the conditions of the existence theorem of the solutions to (SVQEP) in [14], we obtain sufficient conditions for the generalized Levitin-Polyak well-posedness of (SVQEP), which improve the result of [16, Theorem 4.1].
The paper is organized as follows. In Section 2, we present some preliminary concepts. In Section 3, we prove the existence theorem of (SVQEP) that allows for discontinuities. In Section 4, we obtain generalized Levitin-Polyak well-posed results for (SVQEP).
2. Preliminaries
Let X and Y be real locally convex Hausdorff spaces, and let C and D be nonempty subsets of X and Y, respectively. Let Z be a real Hausdorff topological vector space and P c Z a closed convex and pointed cone with k0 e int P.
Assume that B c Z is a nonempty subset. A point b e B is called a minimal point of B,if Bn(b- P) = {b}. A point b e B
is called a weak minimal point of B if B n (b - int P) = 0.A point b e B is called an e-weak minimal point of B if Bn(b -ek0 - int P) = 0. By min B, min^ß, and e-min^ß we denote the sets of all minimal points, weak minimal points, and e-weak minimal points of B, respectively. Obviously, min B ç min^ß ç e-min^ß.
Let E be a nonempty subset of X and let h : E ^ Z be a vector-valued mapping. Consider the following vector-valued optimization problem:
(E, h) : minimize h(x), x e E.
Apointy e E is called a (weak) minimizer of (E,h) if h(y) is a minimal point (weak minimal point) of the set h(E); namely for every x e E,
h(x)-h(y) i -P\ {0} (h(x)-h(y) i - int P).
The set of all (weak) minimizers of (E,h) is denoted by argmin(E,h)(argwmin(E,h)). Obviously, argmin(£, h) c argwmin(£, h).
Let S : C x D ^ 2C and T : C x D ^ 2D be two set-valued mappings and let f,g : C x D —> Z be two vector-valued mappings. Fu [12] defined a class of symmetric vector quasi-equilibrium problems (for short (SVQEP)), which consist in finding (x,~y) e C x D such that x e S(x,y), ~y e T(x,y), and
f (x, y) - f (x, y) i - int P, Vx e S (x, y), g (x, y) - g (x, y) i - int P, Vy e T (x, y).
We call (x, y) a solution of (SVQEP) and denote by X0 xY0 the solution set of (SVQEP). The equilibrium problem contains optimization problem as special case (see [17, 18]). The problem is a generalization of quasi-optimization problem proposed by Crespi and Tan [19].
Definition 1. Let (Z,P) be an ordered topological vector space, let C be a nonempty convex subset of a vector space X, and let h : C ^ Z be a vector mapping.
(i) h is called P-convex if, for every xl,x2 e E and for every A e [0,1], one has
h(Xxx + (1-X)x2) e Xh(x1) + (1 - X)h(x2) - P. (4)
(ii) h is called proper P-quasiconvex if, for every xx,x2 e X and X e [0,1], one has either h(Xx1 + (1 - X)x2) e h(x1) - P or h(Xx1 + (1 - X)x2) e h(x2) - P.
(iii) h is said to be natural P-quasiconvex on E if, for every x1 ,x2 e E, X e [0,1], there exists ^ e [0,1] such that
h (Xx1 + (1 - A) x2) e ^h(x1) + (1 - y)h (x2) - P. (5)
(iv) h is called strict P-convex if, for every x1,x2 e E with x1 = x2 and for every X e (0,1), one has
h(Xx1 + (1-X)x2) e Xh(x1) + (1-X)h(x2) - int P. (6)
Remark 2. It is clear that every strict P-convex mapping is convex, and every convex or proper P-quasiconvex mapping is natural P-quasiconvex. A vector mapping maybe P-convex and not proper P-quasiconvex and conversely (see [20]). A vector mapping maybe natural P-quasiconvex but neither P-convex nor proper P-quasiconvex.
Let F : X ^ 2Y be a set-valued map. F is said to be upper semicontinuous (u.s.c. for short) at x e X if, for any open set U D F(x), there exists a neighborhood V of x such that
|JF(%) :=F(V) c U.
If F is u.s.c. at each point of X, then F is said to be u.s.c. F is said to be lower semicontinuous (l.s.c. for short) at x e X if, for any y e F(x) and any neighborhood U of y, there exists a neighborhood V of x such that Vx' e V; we have
F(x')nU = 0.
F is said to be l.s.c. if F is l.s.c. at every point of X. Moreover, F is said to be continuous if F is both l.s.c. and u.s.c. From [21], we can see that F is lower semicontinuous at x0 e X if and only if, for any y0 e F(x0) and any net [xn] with xn ^ x0, there is a net [yn] such that yn e F(xn) and yn ^ y0. F is said to be closed if the graph of F, that is, Graph(F) = {(x, y) : x e X,ye F(x)}, is a closed set in X x Y.
Let F : X ^ 2X be a set-valued map. A point x e X is called a fixed point of the set-valued map F if x e F(x).
Lemma 3. Let Z be a metric space, let x e X, and let {xn} be a sequence converging to x in X. Let a and z be two elements in Z such that z - a e int P and assume that there exist two sequences {an} and {zn} valued in Z such that
lim d (z, zn -P) = 0, lim d (a, a„ + P) = 0,
where d(z, zn - P) = min{||z -qn\\ : qn e zn - P} and d(a, an + P) = min{||a-ZJ| : ln e an + P}. Thenforalln e N sufficiently large one has zn - an e int P.
The proof of Lemma 3 is similar to that of Lemma 1 in [22]; for details, see [22].
3. Existence Results for (SVQEP)
Throughout this section, let X, Y, and Z be metric spaces, let the sets C c X and D cY be nonempty, convex, and compact subsets, and let P c Z be a closed, convex pointed cone with int P = 0.
Theorem 4. Assume that
(1) S : CxD ^ 2C and T : CxD ^ 2D are continuous, and for each (x, y) e CxD, S(x, y), T(x, y) are nonempty, closed convex subsets;
(2) for any (x,y) e S(x,y)xT(x,y), (xn,yn) e S(xn,yn)x T(xn, yn) for all n e N, and (xn, yn) converging to (x, y), the following conditions hold:
d(f(x,y),f(xn,yn)-P)-^0, d {g (x, y), g (Xn, yn) - P)0;
(3) forany (x,y) e S(x,y)xT(x,y) and [yn] convergingto y such that yn e T(xn, yn), there exists xn e S(xn, yn) such that d(f(x,y),f(xn,yn) + P) ^ 0; for any (x, y) e S(x, y) x T(x, y) and {xn} converging to x such that xn e S(xn, yn), there exists yn e T(xn, yn) such that d(g(x,y),g(Xn,yn) + P) ^ 0;
(4) f(S(x, y), y) and g(x, T(x, y)) are compact sets;
(5) for any fixed y e D, f(x,y) is proper P-quasiconvex in x;for any fixed x e C, g(x, y) is proper P-quasiconvex in y.
Then (SVQEP) has a solution.
Proof. Let us define set-valued maps A : C x D ^ 2C and B-.CxD ^ 2d by
A (x, y) = {ueS (x, y) | f (u, y) e minwf (S (x, y), y)},
V(x,y) eCx D, B (x, y) = {v eT (x, y) I g (x, v) e mi^g (x, T (x, y))},
V(x,y) eCx D.
Similar to the proof of [12, Section 2 Theorem], the set A(x, y) is nonempty and convex. We only need to show the following.
(I) For all (x, y) e C x D, the set A(x, y) is closed. In fact, let a sequence {un} c A(x, y) and un ^ u; we need to show that u e A(x, y). It follows from un e S(x, y) and the closedness of S(x, y) that u e S(x, y). Since
f(Un,y) e minwf(S(x,y),y),
we have
f(un>y)-f(z>y)t int P, VzeS(x,y). (13)
If there exists z0 e S(x, y) such that
f(u,y)-f(z0,y)e int P, (14)
from condition (2), d(f(u, y), f(un, y) - P) ^ 0; thus,
d {f (u, y)-f (zo, y), f {Un, y)-f (z0, y)-P)-^ 0.
From Lemma 3, f(un,y)-f(z0,y) e int P for n large enough. It is a contradiction.
(II) A is u.s.c., since C is a compact set and A(x, y) c C. By [12, Lemma 2(ii) ], we need only to show that the set-valued map A is closed. Let a sequence i(xn,yn)} c CxD, (xn,yn) ^
(x,y) and un e A(xn,yn). Since un e S(xn,yn) and the set-valued map S is continuous, we have u e S(x, y). For any z e S(x, y), since S is l.s.c., there is a sequence |zn|, zn e S(xn, yn) such that Zn ^ z. Since f(Un,yJ e minw f(S(Xn, yj, yj, we get
f (un, yn) - f (Zn, yn) t int P, yzn e S (xn, yn). (16)
If there exists z e A(x, y) such that f(u, y) - f(z, y) e int P, from (ii),
d(f(u,y),f(un,yn)-P)-^0. (17)
From (iii), there exists ~zn e S(xn, yn) such that
d(f(z,y), f(zn, yn)+P)~^0. (18)
By Lemma 3, f(un, yn) - f(zn, yn) e int P, which contradicts (16). □
Remark 5. It is clear that if f and g are continuous mappings and condition (1) holds, then conditions (2), (3), and (4) of Theorem 4 hold. The following example shows that Theorem 4 improves [12, Section 2. Theorem].
Example 6. Suppose that X = Y = R, C = D = [0,2], and P = R+ and let S : C x D ^ 2C and T : C x D ^ 2D be defined as S(x, y) = C and T(x, y) = D, respectively. For all (x,y) e R2, let
f(x,y) = {
g(x, y) =
(0,1), if x e [0,1),
{y,1), if x=[1,2],
(1,0), if ye [0,1),
(1,x), if ye[1,2].
It is clear that the mappings f and g are not continuous, but all the conditions of Theorem 4 hold.
Moreover, let x* = (1,1); we can get from [23, Lemma 2.2] that the mappings f and g are natural P-quasiconvex but not demicontinuous (see [14, Definition 2.4]. Therefore, Theorem 4 is different from [14, Theorem 3.1].
4. Well-Posedness of (SVQEP)
In this section, we discuss the notion of generalized Levitin-Polyak well-posedness for (SVQEP).
Definition 7. A sequence {(xn,yn)} c CxD is called a Levitin-Polyak approximating solution sequence (in short LP sequence) for (SVQEP) if there exists {en} c R+ with en ^ 0 such that
d S y^) < d (yw T y^) < f(^ yn) - f(x^ yn) + £nko t - int P, VxeS (x^ yn), 9 (xn, y)-0 (xn, yn) + enko t- int P, Vy eT(
Definition 8. The problem (SVQEP) is said to be generalized Levitin-Polyak well-posed (in short LP well-posed) if
(i) = 0;
(ii) for every LP sequence {(xn, yn)}, there exist a subsequence {(xnt,y )} c {(xn,yn)} and an element (x*,y*)eX° xY° such that (x„k ,y„k) ^ (x*,y*).
Let us illustrate the notion of generalized LP well-posedness by some examples.
Example 9. Let X = Y = Z = R, C = D = [0,1],and P = R+. For all (x, y) e CxD, let f(x, y) = x + y and g(x, y) = y-x. Set-valued mappings S : CxD ^ 2C and T : CxD ^ 2D are defined by S(x,y) = T(x,y) = [0,1]; (SVQEP) is generalized LP well-posed.
Example 10. Let X = Y = Z = R, C = D = [0,An], and P = R+. For all (x,y) e C x D, let f(x,y) = sin xy and g(x,y) = cos xy. Set-valued mappings S : C x D ^ 2C and T : C x D ^ 2d are defined by S(x, y) = [2n, An] and T(x, y) = [1,2]; (SVQEP) is not generalized LP well-posed.
Remark 11. (i) Generalized LP well-posedness of (SVQEP) implies that the set X° x Y° is compact.
(ii) It is easy to see that the notion of well-posedness of (SVQEP) generalizes the notion of generalized LP well-posedness of vector equilibrium problem introduced in [20].
Theorem 12. Let {en} c R+ with en ^ 0. Under the assumptions of Theorem 4, (SVQEP) is generalized LP well-posed.
Proof. Let {en} c R+ with en ^ 0 and
d(xn,S(xn,yn)) < en,
f(x' yn) - f (xn> yn) + £nk0 t - int P> Vx eS(xn,yn); d(yn>T(Xn,yn)) < £n,
9 (xn' y)-9 (xn' yn) + £nko <t - int p>
^y 6 T(xn,yn)-
Since S, T are continuous and compact-valued, there exist a subsequence {(x ,y)} c {(xn,yn)} and an element (x0,y0) 6 S(x0,y0) xT(x0,y0) suchthat {(xnk ,ynk)} ^ (x0,y0). If there exists x 6 S(x0,y0), such that f(x,y) 6 f(x0, y0) - int P, from Theorem 4(ii),
d (f (x0, y0), f (xnt,ynt) - entk0 (22)
From Theorem 4(iii), there exists xnk 6 S(xnk,yHk) such that
d(f(x,y),f(xnt ,ynt ) + P)-^0. (23)
By Lemma 3,
f (xnk ,ynk )-f (xnk ,ynk) + ¿nk h 6 - int P (24)
when nk is large enough, which is a contradiction. Therefore, f(x,yo)-f(xo,yQ)t- int P, VxeS (x°, yQ). (25) Similarly,
g{^,y)- g(xo,yo)t- int vytT^y^. (26)
From Definition 7, (SVQEP) is generalized LP well-posed.
Definition 13 (see [23]). Let X be a topological space, and let Z be a topological vector space. A function f : X ^ Z is said to be demicontinuous if
f-1 (M) = [x 6 X: f(x) 6 M} is closed in X for each closed half space M c Z.
Lemma 14 (see [23]). Let X be a topological space, Z a topological vector space, and f : X ^ Z a demicontinuous function. Thenfor any x* 6 Z*, the comp ositefunction x* of is continuous, where Z* is the topological dual space of Z.
Let P c Z be a closed convex and pointed cone with int P = 0 and
T = [x* 6 Z* : x* separates the sets P and - int P}. (28) By [24, p. 165, Theorem 2], there exists x* 6 Z* such that Vx 6 P, x* (x) > 0,
Vx6- int P, x* (x) < 0. We get that T = 0.
Lemma 15. If (x*,x) < 0 for all x* 6 T, then x 6 - int P.
Proof. If we assume that there exists x t - int P such that (x*,x) < 0 for all x* 6 T, then we have
- int P^[Ax + (1 - A) p : A 6 [0,1],p 6 P} = 0. (30)
If not, there exist y 6 int P, A 6 [0,1], and p 6 P such that -y 6 Ax + (1 - A)p. Thus,
x = -1(\.l + (1-\)p) 6- int P. (31)
It is a contradiction. Thus, (30) holds. By [24, p. 165, Theorem 2], there exists x*' 6 Z* such that, for all y 6 - int P,
X*' (y) < 0,
and for all y e {Ax + (1 - A)p : A e [0,1],p e P},
x*' (y) > 0. (33)
Then, x*'(x) > 0 and x*' e T. This, however, contradicts the fact that (x*,x) < 0 for all x* e T. □
Theorem 16. Assume that
(1) S : CxD ^ 2C and T : CxD ^ 2D are continuous, and for each (x, y) e CxD, S(x, y), T(x, y) are nonempty, closed convex subsets;
(2) f,g:CxD ^ Z are demicontinuous;
(3) for any fixed y e D, f(x, y) is natural P-quasiconvex in x; for any fixed x e C, g(x, y) is natural P-quasiconvex in y.
Then (SVQEP) is generalized LP well-posed.
Proof. From [14, Theorem 3.1], X0 xY0 = 0. Let {en} c R+
with en ^ 0 and
'{xn,S{xn,yn)) < £n,
f (x, yn) + enko - f (xn, yn) t - int P, (34)
Vx eS(Xn,yn); d (y„ T (Xn, yn)) < £n>
9 (xn> y) + £nko - 9 (xn> yn) t - int P> (35)
^y e T(xn,yn)-
Since S, T are continuous and compact-valued, there exist a subsequence {(xnt,y )} c {(xn,yn)} and an element (Xo,yo) e S(Xo,yo,) x T(Xo,yo) such that (xnt ,ynt) ^
(x0, yo). If there exists x e S(xo, yo), such that
f(x,yo)ef(xo,yo)- int P, (36)
for all x* e T, we have
** (ffryo)-f(xo,yo))<0- (37)
** (ffryo))<** (f(*o>yo))- (38)
Since S is l.s.c. at x, there exists xn e S(xn, yn) such that xn ^ x. By Lemma 14, x*(f(Xnk,ynk))+x*(enkko) < x*(f(Xnk,ynk)) when nk is large enough. By Lemma 15,
f(*nk ,ynk )-f(xnk ,ynk) + % ko e - int P, (39)
which contradicts (34). Therefore, (SVQEP) is generalized LP well-posed. □
Let K c Rn be a closed set, let f : K c Rn ^ Rl, and consider a cone C c Rl to be closed, convex, pointed, and with nonempty interior. We consider the following vector optimization problem.
(VP) Find x0 e K such that
f(x)-f(x0)i- int C, VxeK.
As a consequence of Theorem 16, we have the following well-posed result for the solution of (VP).
Corollary 17. Let K c Rn be a compact set, and let f: Rn ^ Rl be demicontinuous and natural C-quasiconvex on K. Then, (VP) isgeneralizedLP well-posed.
Remark 18. (i) From Remark 2, every strict P-convex mapping is natural P-quasiconvex. Then Theorem 16 improves [16, Theorem 4.1].
(ii) From [23, Lemma 2.1(iii) ], every natural C-quasiconvex function is C-quasiconvex. In the assumption of f being continuous, Corollary 17 is a special case of [18, Theorem 4.2].
Conflict of Interests
The authors declare that there is no conflict of interests regarding the publication of this paper.
Acknowledgments
The authors would like to thank the anonymous referee for his/her valuable comments and suggestions, which helped in improving the paper. This work is supported by the Fundamental Research Funds for the Central Universities (JBK130401), by Humanities and Social Science Project of Ministry of Education of China (14XJC), and by Soft Science Research Project of Sichuan Province (2014ZR0027).
References
[1] A. N. Tykhonov, "On the stability of the functional optimization problem," USSR Computational Mathematics and Mathematical Physics, vol. 6, no. 4, pp. 28-33,1966.
[2] E. Miglierina, E. Molho, and M. Rocca, "Well-posedness and scalarization in vector optimization," Journal of Optimization Theory and Applications, vol. 126, no. 2, pp. 391-409, 2005.
[3] D. Dentcheva and S. Helbig, "On variational principles, level sets, well-posedness, and £-solutions in vector optimization," Journal of Optimization Theory and Applications, vol. 89, no. 2, pp. 325-349, 1996.
[4] R. Hu and Y.-P. Fang, "Set-valued increasing-along-rays maps and well-posed set-valued star-shaped optimization," Journal of Mathematical Analysis and Applications, vol. 331, no. 2, pp. 13711383, 2007.
[5] M. B. Lignola, "Well-posedness and L-well-posedness for qua-sivariational inequalities," Journal of Optimization Theory and Applications, vol. 128, no. 1, pp. 119-138, 2006.
[6] R. Lucchetti and I. Revalski, Eds., Recent Developments in Well-Posed Variational Problems, vol. 331, Kluwer Academic Publishers, Dordrecht, The Netherlands, 1995.
[7] E. S. Levitin and B. T. Polyak, "Convergence of minimizing sequences in conditional extremum problems," Soviet Mathematics Doklady, vol. 7, pp. 764-767,1966.
[8] A. S. Konsulova and J. P. Revalski, "Constrained convex optimization problems—well-posedness and stability," Numerical Functional Analysis and Optimization, vol. 15, no. 7-8, pp. 889907,1994.
[9] X. X. Huang and X. Q. Yang, "Levitin-Polyak well-posedness of constrained vector optimization problems," Journal of Global Optimization, vol. 37, no. 2, pp. 287-304, 2007.
[10] X. X. Huang and X. Q. Yang, "Levitin-Polyak well-posedness in generalized variational inequality problems with functional constraints," Journal of Industrial and Management Optimization, vol. 3, no. 4, pp. 671-684, 2007.
[11] S. J. Li and M. H. Li, "Levitin-Polyak well-posedness of vector equilibrium problems," Mathematical Methods of Operations Research, vol. 69, no. 1, pp. 125-140, 2009.
[12] J.-Y. Fu, "Symmetric vector quasi-equilibrium problems," Journal of Mathematical Analysis and Applications, vol. 285, no. 2, pp. 708-713, 2003.
[13] E. Blum and W. Oettli, "From optimization and variational inequalities to equilibrium problems," The Mathematics Student, vol. 63, no. 1-4, pp. 123-145,1994.
[14] A. P. Farajzadeh, "On the symmetric vector quasi-equilibrium problems," Journal of Mathematical Analysis and Applications, vol. 322, no. 2, pp. 1099-1110, 2006.
[15] S. J. Li, K. L. Teo, and X. Q. Yang, "Generalized vector quasi-equilibrium problems," Mathematical Methods of Operations Research, vol. 61, no. 3, pp. 385-397, 2005.
[16] W. Y. Zhang, "Well-posedness for convex symmetric vector quasi-equilibrium problems," Journal of Mathematical Analysis and Applications, vol. 387, no. 2, pp. 909-915, 2012.
[17] G. P. Crespi, M. Papalia, and M. Rocca, "Extended well-posedness of quasiconvex vector optimization problems," Journal ofOptimization Theory andApplications, vol. 141, no. 2, pp. 285-297, 2009.
[18] G. P. Crespi, A. Guerraggio, and M. Rocca, "Well posedness in vector optimization problems and vector variational inequalities," Journal of Optimization Theory andApplications, vol. 132, no. 1, pp. 213-226, 2007.
[19] G. P. Crespi and N. X. Tan, "On vector quasi-optimization problems," Rendiconti del Seminario Matematico di Messina II, vol. 8(23), pp. 283-296, 2001.
[20] F. Ferro, "A minimax theorem for vector-valued functions," Journal ofOptimization Theory andApplications, vol. 60, no. 1, pp. 19-31, 1989.
[21] J.-P. Aubin and I. Ekeland, Applied Nonlinear Analysis, John Wiley & Sons, New York, NY, USA, 1984.
[22] P. Loridan and J. Morgan, "Convergence of approximate solutions and values in parametric vector optimization," in Vector Variational Inequalities and Vector Equilibria, F. Giannessi, Ed., vol. 38, pp. 335-350, Kluwer Academic Publishers, Dordrecht, The Netherlands, 2000.
[23] T. Tanaka, "Generalized quasiconvexities, cone saddle points, and minimax theorem for vector-valued functions," Journal of Optimization Theory andApplications, vol. 81, no. 2, pp. 355-377, 1994.
[24] C. Swartz, An Introduction to Functional Analysis, vol. 157, Marcel Dekker, New York, NY, USA, 1992.
Copyright of Abstract & Applied Analysis is the property of Hindawi Publishing Corporation and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use.
