CC BY
0Hindawi Publishing Corporation Abstract and Applied Analysis Volume 2014, Article ID 792984, 7 pages http://dx.doi.org/10.1155/2014/792984
Research Article
LP Well-Posedness for Bilevel Vector Equilibrium and Optimization Problems with Equilibrium Constraints
Phan Quoc Khanh,1 Somyot Plubtieng,2 and Kamonrat Sombut2
1 Department of Mathematics, International University of Ho Chi Minh City, Linh Trung, Thu Duc, Ho Chi Minh City, Vietnam
2 Department of Mathematics, Faculty of Science, Naresuan University, Phitsanulok 65000, Thailand
Correspondence should be addressed to Somyot Plubtieng; somyotp@nu.ac.th Received 21 January 2014; Accepted 9 March 2014; Published 17 April 2014 Academic Editor: Chong Li
Copyright © 2014 Phan Quoc Khanh 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.
The purpose of this paper is introduce several types of Levitin-Polyak well-posedness for bilevel vector equilibrium and optimization problems with equilibrium constraints. Base on criterion and characterizations for these types of Levitin-Polyak well-posedness we argue on diameters and Kuratowski's, Hausdorff's, or Istratescus measures of noncompactness of approximate solution sets under suitable conditions, and we prove the Levitin-Polyak well-posedness for bilevel vector equilibrium and optimization problems with equilibrium constraints. Obtain a gap function for bilevel vector equilibrium problems with equilibrium constraints using the nonlinear scalarization function and consider relations between these types of LP well-posedness for bilevel vector optimization problems with equilibrium constraints and these types of Levitin-Polyak well-posedness for bilevel vector equilibrium problems with equilibrium constraints under suitable conditions; we prove the Levitin-Polyak well-posedness for bilevel equilibrium and optimization problems with equilibrium constraints.
1. Introduction
Well-posedness is one of most important topics for optimization theory and numerical methods of optimization problems, which guarantees that, for approximating solution sequences, there is a subsequence which converges to a solution. The well-posedness of unconstrained and constrained scalar optimization problems was first introduced and studied by Tikhonov [1] and Levitin and Polyak [2], respectively. In Tikhonov well-posedness, which means the existence and uniqueness of minimizer and the convergence of a subsequence of each approximation sequence to a solution, the Tikhonov notation has been more interested; that is, any algorithm can generate only an approximating sequence of solutions. Hence, this sequence is applicable only if the problem under consideration is well posed. The concept of Tikhonov well-posedness has also been generalized to several related problems: variational inequalities, Nash equilibrium problems, optimization problems with variational inequalities constrains, optimization problems with Nash equilibrium
constrains, optimization problems with Nash equilibrium constrains [3-12], and so forth.
The study of Levitin-Polyak (LP for short) well-posedness for scalar convex optimization problems with functional constraints originates from [13]. Recently, this research was extended to nonconvex optimization problems with abstract and functional constraints [14] and nonconvex vector optimization problems with both abstract and functional constraints [15]. In 2009, S. J. Li and M. H. Li [16] introduced and researched two types of LP well-posedness of vector equilibrium problems with variable domination structures. In the same year, Huang et al. [17] introduced and researched the LP well-posedness of vector quasi-equilibrium problems. Moreover, Li et al. [18] introduced and researched the LP well-posedness for two types of generalized vector quasi-equilibrium problems.
Most recently, many papers appeared dealing with bilevel problems such as mathematical programming with equilibrium constraints [19, 20], optimization problems with Nash equilibrium constraints [21], optimization problems
with variational inequality constraints [4], and optimization problems with equilibrium constraints [20, 22]. In 2012, Anh et al. [23] considered the LP well-posedness of bilevel equilibrium problems with equilibrium constraints (BEPEC) and bilevel optimization problems with equilibrium constraints (BOPEC). They introduced a relaxed level closedness and use it together with pseudomonotonic assumptions to establish sufficient conditions of LP well-posedness.
The vector equilibrium problem is a unified model of several classes of problems, for example, vector optimization problems and vector variational inequality problems [24, 25]. In recent years, many authors have intensively studied different types of vector equilibrium problem [26-28]. Many results on existence and stability of solutions for vector equilibrium problem, generalized vector equilibrium problems, and generalized quasivector equilibrium problems have been established [26-31]. Moreover, many authors have investigated the gap functions for vector equilibrium problems, generalized vector equilibrium problems, and generalized quasivector equilibrium problems [28].
Motivated and inspired by the above observations, our consideration of LP well-posedness for bilevel problems is in this paper. We focus on vector equilibria with equilibrium constraints and optimization with equilibrium constraints, as well as an abstract set constraint, and investigate criteria and characterizations for these types of LP well-posedness with a gap function for bilevel vector equilibrium problems with equilibrium constraints and optimization problems with equilibrium constraints. We propose a generalized level closedness and use it together to study well-posedness in the LP sense. However, since the existence topic has been intensively studied for vector equilibrium and bilevel problems, we focus on LP well-posedness, assuming always that the mentioned solutions exist.
The layout of the paper is as follows. In Section 2, we state the bilevel problems under our consideration and recall notions and preliminaries needed in the sequel. In Section 3, we study LP well-posedness of bilevel vector equilibrium problems with equilibrium constraints and optimization problems with equilibrium constraints on diameters and measures of noncompactness of approximate solution sets in the Kuratowski, Hausdorff, or Istratescu sense. In Section 4, by virtue of a nonlinear scalarization function and a gap function for bilevel vector quasi-equilibrium problems, we show equivalent relations between the LP well-posedness of the optimization problem and the LP well-posedness of bilevel vector equilibrium problems. The results in this paper unify, generalize, and extend some known results in [16, 23].
2. Preliminaries
Let (X,d) and Z be locally convex Hausdorff topological vector spaces, where d is a metric which is compatible with the topology of X. Throughout this paper, suppose C : X x Z ^ 2Z is a set-valued mapping such that, for any x e X, C(x) is a pointed, closed, and convex cone in Z with nonempty interior int C(x), where C(x) depends on x. We also assume that e : X ^ Z is a continuous vector-valued mapping and satisfies that, for any x e X, e(x) e int C(x).
Let f : XxXxZ ^ Z be a vector-valued mapping and Kj : X x Z ^ 2X, i = 1,2. The constraints appear in this paper are solution sets of the following (parametric) vector quasi-equilibrium problem, for each z e Z:
(VQEPj find x eK1 (x, z) s.t. f (x, y,z)£- int C (x),
Vy e K2 (x, z).
Instead of writing |(VQEPZ) | z e Z] for the family of quasi-equilibrium problems, that is, the parametric problem, we will simply write (VQEP) in the sequel. Let S : Z ^ 2X be the solution map of (VQEP). Let Y = X x Z, F:YxY ^ Z, and g : X x Z ^ Z be two functions with g(x, z) e D. We consider the following bilevel vector equilibrium problem with equilibrium constraints:
(BVEPEC) finding y e grS s.t., F (~y, y) t - int C (y), Vy e grS,
where grS denotes the graph of S; that is, grS := {(x, z) | x e S(z)}. We denote by Q the set of solutions of (BVEPEC). We first defined LP well-posedness notions.
Definition 1. A sequence {x*] = l(xn,zn)] c XxZ is called type I LP approximating sequence for (BVEPEC) if and onlyif there exists a sequence of nonnegative real number {en] with en ^ 0 such that
d(xn, g?S)<en; (3)
F(xl,y") + ene(xl) t - int C(xl) Vy e grS (z), z e Z, where y* = (y, z); [xn] is an approximating sequence for the parametric problem (VQEP) corresponding to {zn}.
Definition 2. A sequence {x**} = {(xn,zn)} c XxZ is called type II LP approximating sequence for (BVEPEC) if and only if there exists a sequence of nonnegative real number {en} with en ^ 0 such that (3)-(5) hold and for any n e N there exists {y**} e grS such that
F(xn,y^l)-ene(Xn) e -c(x*).
Definition 3. Problems (BVEPEC) is called type I (resp., type II) LP well-posed if and only if
(i) the solution set of (BVEPEC) is nonempty;
(ii) for any type I (resp., type II), LP approximating sequence of (BVEPEC) has a subsequence converging to a solution.
Recall now some notions. Let X and Z be as above and let T : X ^ 2Z be a multifunction. T is called lower semicontinuous (lsc) at x0 if and only if T(x0) n U = 0.
For some open subsets, U c Z implies the existence of a neighborhood N of x0 such that T(x) n U = 0 for all x e N. T is upper semicontinuous (usc) at x0 if and only if, for each open subset U 2 T(x0), there is a neighborhood N of x0 such that U 2 T(N). T is called closed at xq if and only if, for each net (xa,ya) e grT with (xa,ya) ^ (^^), one has y0 e T(x0). We say that T satisfies a certain property in a subset A c X if and only if T satisfies it at every point of A. If A = dom T := {x | T(x) = 0}, we omit "in dom T" in the saying. The following assertions are known:
(i) T is lsc at x0 if and only if Vxa ^ x0, Vy e T(x0), 3ya e T(xa),andya ^ y;
(ii) T is closed if and only if grT is closed;
(iii) T is usc at x0 if T(A) is compact for any compact subset A of dom T and T is closed at x0;
(iv) T is usc at x0 if Z is compact and T is closed at x0.
Definition4 (see [23]). Let X and Y be topological spaces, and f:X^ R.
(i) f is called upper 0-level closed at x0 e X if and only if, for any sequence {xn} converging to x0,
[f(xn)>0,Vn] [f(x0)>0].
(ii) f is called lower 0-level closed at x0 e X if and only if, for any sequence {xn} converging to x0,
[f(xn)<0,Vn]
[f(xo)<0].
Definition 5. Let X be Hausdorff topological spaces and let Z be a topological vector space f : X ^ Z. The function f is called upper 0-level closed at x0 e XxY if and only if, for any {xn} converging to x0,
[f (xn) t - int C, Vn] =^[f(x0)t- int C]. (9)
Definition 6 (see [32]). Let A, B be nonempty subsets of metric space X. The Hausdorff distance ■) between A and B is defined by
H (A, B) = max (A, B), S (B, A)},
where S(A,B) = supaeAd(a,B) with d(a,B) = infheBd(a,b). Let {An} be a sequence of nonempty subsets of X. We say that {An} converges to A in the sense of Hausdorff metric if H(An, A) ^ 0. It is easy to see that S(An, A) ^ 0 if and only if d(an, A) ^ 0 for all selection an e An. For more details on this topic, we refer the readers to [32].
3. Bilevel Vector Equilibrium Problems with Equilibrium Constraints (BVEPEC)
In this section, we give some criteria and characterizations for LP well-posedness of (BVEPEC) using noncompactness. Now, we need the following notions of measures of noncom-pactness.
Definition 7. Let M be a nonempty subset of a metric space X.
(i) The Kuratowski measure of M is p(M)
e>0\Mc \jMk ,
diamMk < e, k = 1, ...,n, for some n e N
(ii) The Hausdorff measure of M is
q (M) = inf
e>0\Mc \\B(xk,e),
xk e X, for some n e N
(iii) The Istratescu measure of M is
1 (M) = inf {e > 0 I M have no infinite e- discrete subset}.
The following inequalities are obtained in [33]:
n(M)<i(M)<p(M)<2n(M). (14)
The measures and 1 share many common properties and we will use y in the sequel to denote that either one of them y is a regular measure [34, 35]; that is, it enjoys the following properties:
(i) y(M) = if and only if the set M is unbounded;
(ii) y(M) = y(cl M);
(iii) if y(M) = 0, then M is a totally bounded set;
(iv) if X is a complete space and if {An} is a sequence of closed subset of X such that An+1 c An for each n e N and limn^+TOH(An, K) = 0, where H is the Hausdorff metric;
(v) if M c N, then y(M) < y(N).
As above, S(z) denotes the solution set of (VQEPZ). For positive e, the e-solution set of (VQEPZ) is defined by
S (z,e) = [x e K1 (x, z) | f (x, y, z) + ee (x) t - int C (x), VyeK2 (x,z)}.
For positive Ç and e, the corresponding approximate solution sets for (BVEPEC) are defined, respectively, by
Г (Ç,e) := [x* = (x, z) e K1 (x,z) x Z | d(x*, grS) < e,
F (x*, y* ) + ее (x) i - int С (x) ,Jy* e grS,
f (x, y, z) + Çe (x) i - int С (x),
VyeK2 (x,z)}
Г2 (Ç,e) := [x* = (x, z) e K1 (x,z) x Z | d(x*, grS) < e,
F (x*, у* ) + ее (x) i - int С (x) ,Jy* e grS,
f (x, y, z) + Çe (x) i - int С (x),
Jy e K2 (x,z),F(x*,y*)-ee(x) e -C(x)}.
In terms of a measure y e , ц, i} of noncompactness we have the following result.
Theorem 8. Let X and Z be complete and y e [p,q,i}. Assume that
(i) in XxZ, K1 is closed and K2 is lsc;
(ii) f is upper 0-level closed in K1(X, Z) x K2(X, Z) x Z;
(iii) F(-, y* ) is upper 0-level closed inXxZ,for all y* e grS;
(iv) the mapping W : X x Z ^ 2Z defined by W(x) = Z\- int C(x) is closed.
Then, (BVEPEC) is type I LP well posed if and only if y (Г (Ç, e)) 0 (resp., y (Г3 (Ç, e)) 0)0
as (Ç,e) (0,0).
Proof. By the relationship (14), the proof is similar for the three mentioned measures of noncompactness. We discuss only the case y = p, the Kuratowski measure. Assume that (BVEPEC) is type I LP well posed. The solution set Q of (BVEPEC) clearly the relation Q C r^e). Hence,
H (Г1 (£ e),Q) = max [5 (Г1 ($ e),Q),S (Q Г (Ç, e))} = 5(Г (Ç,e),Q).
Let jxj^} = {(xn, zn)j be in Q. Since jx**} is an approximating sequence, it has a subsequence converging to some points of Q. Therefore, Q is compact.
Assume that Q c \Jn,=1Mk with diam Mk < e, Vk = l,...,n. Setting Nk = jz e X \ d(z,Mk) < H(r1(^,e),Q)}, it obvious that r1(^, e) C \\^=1Nk and diam Nk < e + 2H(rl(i;, e), Q). Since Q is compact and p(Q) = 0, then we get
p (r1 e)) < 2H (r1 e),Q) + p (Q) = 28 (r1 e),Q).
Next, we show that Н(Г1(^,е),П) ^ 0 as (Ç,e) ^ (0,0).By contradiction, suppose the existence of p > 0, (Ç, e) ^ (0,0) and xn e Г1(^и, en) such that d(xn, i) > p, Уп e N. This contradicts the type I LP well-posedness. So, H(rl(i;,e),^) ^ 0 as (Ç,e) ^ (0,0). It follows that (17)holds.
Conversely, first, we show that for all ¡;,e > 0, Г1(^, e) is closed. Assume that ^(Г1(£,, e)) ^ 0 as (Ç,e) ^ (0,0). Let {x**} = i(xn,zn)} c Г(Ç,e) with {x**} ^ x* := (x,z). Then, for all y* e grS and yn e K2(xn, Zn),
d(x*, grS) < e;
F(x*,y*) + ee(x* )t- int С (x*), (20)
f ^ У^ Zn) + & (xn) t- int С (xn) ■
As K1 is closed at (x, z), we have x e K1(x, z). From (20), we obtain that d(x*, grS) < e. By the upper 0-level closedness of F in first argument and assumption (iv), one obtain
F (x*, y*) + ee(x*) eW (x* );
that is,
F(x*,y*) + ee(x*) i-intC(x*), Vy* e grS. (22)
Next, we show by contrapositive that f(x, y, z) + Çe(x) i - int C(x), Vy e K2(x,z). Suppose that there exist y e K2(x,z) such that f(x,y,z) + Çe(x) e - int C(x). Since K2 is lsc at (x, z), there exist yn e K2(x, z) such that yn ^ y. By upper 0-level closedness of f at (x, y, z), there is n0 e N such that
f(x„, y„, zn) + & (xn) e- int C (xj , Vn>n0. (23)
That is a contradiction. Thus, we have
f(x,y,z) + &(x)t- int C(x), Vy e K2 (x,z). (24)
Therefore, x* e r^, e) and so r1 (Ç, e) is closed. Secondly, we show that
Q= ПГ (?,e).
ï,e>0
It is obvious that Q c n^e>o r1(^, e). Now, suppose that (L> en) ^ (0,0) and x* e H?>e>o r1(^n> en). Thus, we have
d(x*, grS) < en;
F(x*,y*) + ene(x*)i-int С (x*), ^Jy* e grS, (27) f(x,y,z)+$ne (x) i - int С (x), J y e K2 (x,z). (28) By (27) and (28) and closedness of W(x*), we obtain F(x*,y*)eW(x*), Jy* e grS,
f (x, y,z)eW (x), J y e K2 (x, z). That is, x* e Г (Ç, e). Hence, (25) holds.
We know that ^i(rl(^,e)) ^ 0 as ($,e) ^ (0,0).Then,by properties of p, we see that Q is compact and H(r1 e)) ^ 0 as ($,e) ^ (0,0). Let {x*} = {(xn,zn)} be a type I LP approximating solution sequence for (BVEPEC). There is {(£,n,en)} ^ (0,0) such that, for all y* e grS and y e K2(x, z),
d(x*n, grS) < en, F(x*n,y*) + ene(x*n) t- int C (x**),
f y , Zn) + Zne {xn) int c (xn) ■
Therefore, x* e r1(^n, en). It follows that, from ^i(rl(H,, e)) ^ 0 as ($,e) ^ (0,0),
d(x*, Q) < H {r1 ($, e), Q) —> 0.
By the compactness of Q, there is a subsequence of [xn] convergent to some points of Q. Hence, (BVEPEC) is type I LP well posed. This completes the proof. □
Similar to Theorem 8, we can prove that the following results.
Theorem 9. Let X and Z be complete and y e {^,rj,i}. Assume that
(i) in XxZ, K1 is closed and K2 is lsc;
(ii) f is upper 0-level closed in K1(X, Z) x K2(X, Z) x Z;
(iii) F(-,y*) is upper 0-level closed in XxZ,for ally* e grS;
(iv) the mapping W : X x Z ^ 2Z defined by W(x) = Z\- int C(x) is closed;
(v) the set-valued mapping C :XxZ ^ 2z is closed;
(vi) for any x e Q, F(x*,y*) e -dC and 3y* e grS and for any x e S, f(x, y, z) e -dC and 3y e K2(x, z).
Then, (BVEPEC) is type II LP well posed if and only if 7^2^,e)) ^ 0(resp.,y(r4 ($,e)) ^ 0) ^ 0 as ($,e) ^ (0,0).
4. Optimization Problem with Equilibrium Constraints (OPEC)
In this section, we will present the criteria and characterization for four types of (BVEPEC) and introduce a gap function for (BVEPEC) using the nonlinear scalarization function and then we investigate the equivalent relations between the LP well-posedness for bilevel vector optimization problem with equilibrium constraints (BVOPEC) and the LP well-posedness for vector equilibrium problem with equilibrium constraints (BVEPEC). Now, consider the following optimization problem with equilibrium constraints.
Let S : Z ^ 2X be the solution map of (VQEP). Let 0 : X x Z ^ R, where R = (-ot,+ot]. The bilevel vector optimization problem with equilibrium constraints is as follows:
(BVOPEC) minimize 0 (x, z) s.t., x* := (x, z) e grS.
Note that z is a parameter of the vector quasi-equilibrium problem defining the constraint, but it is a component of the decision variable (x, z) of (BVEPEC) and (BVOPEC) and these problems are not parametric.
Definition 10. A sequence {x**} = {(xn, zn)} cXxZ is called type I LP minimizing sequence for (BVOPEC) if and only if
d(K, grs) 0;
lim sup ^{x*n) < V*;
[xn] is an approximating sequence for (QEP) corresponding to {zn} ■
Definition 11. A sequence {x**} = {(xn, zn)} cXxZ is called type II LP minimizing sequence for (BVOPEC) if and only if (33) and (35) hold and
lim 0 (xn) = V*.
Definition 12. Problems (BVOPEC) is called type I (resp., type II) LP well posed if and only if
(i) the solution set of (BVOPEC) is nonempty;
(ii) for any type I (resp., type II), LP minimizing sequence of (BVOPEC) has a subsequence converging to a solution.
Now, we recall the definition of nonlinear scalarization function introduced by Chen et al. [36].
The nonlinear scalarization function ¡;e : Z ^ R is defined by
£e (x) = min {X e R : x-Xe(x) e -C (%)} ■
Definition 13. A mapping 0 :Y ^ R U {+ot} is called a gap function for (BVEPEC) if
(i) 0(x) >0, Vxe Y;
(ii) <p(x*) = 0, Vx* e grS if and only if x* e Q.
We introduced the following gap function defined by 0* (x) = sup {-£,e (F (x, y))}, Vx e grS. (38)
yegrS (38)
Remark 14. (i) By Definition 4, it is easy to see that $>*(x) is a gap function for (EPEC). Moreover, if Q = 0, then Dom(0*(x))n grS = 0.
(ii) By Definition 4, it is clear that x0 e Q if and only if x0 minimizes 0* (x) over grS with 0* (x0) = 0.
Now, we prove the following lemma.
Lemma 15. Let for any x e grS, F(x,x) e -dC(x), where dC(x) is the topological boundary ofC(x) and F(-, y) is upper 0-level closed on X x Z,for all y e grS. Then, the mapping 0* defined by (38) is lower 0-level closed onXxZ.
Proof. Suppose that {x**} e grS satisfies x* ^ x* e grS and 4>*(x**l) <b, Vne N. Follows from (38)
ф*(хп)* = sup К (F(X;,y))}<0.
Then, %e(F(x**, y)) > 0, Vy e grS. By the upper closed 0-level of F in first argument, we know that
That is,
teF(x',y)>0, Vye grS.
ф* (x*) = sup К (F(x*,y))}<0.
Then, we have that ф*(х*) is lower closed 0-level. This completes the proof. □
Theorem 16. Suppose that the assumptions of Lemma 15 are satisfied. Then the following results hold:
(i) (BVEPEC) is the type I LP well-posedness if and only if (BVOPEC) is the type I LP well-posedness with the function ф defined by (38).
(ii) (BVEPEC) is the type II LP well-posedness if and only if (BVOPEC) is the type II LP well-posedness with the function ф defined by (38).
Proof. (i) We know that ф* is a gap function of (BVEPEC), and x* e Q if and only if x* e grS with v = ф*(х*) = 0. Assume that {x**} = {(xn ■ zn)} is any type I LP approximating solution sequence for (BVEPEC). Then, there exist {en} > 0 with en ^ 0 such that
d(x*n, grS)<en; (42)
F(x*rl,y*)+ee(x*rl)t-intС(х*), Vy* e grS, (43)
f (Xn, уп> Zn) + & (xn) t- int C (xn) > 4yn e K2 (Xn, Zn) .
It follows from (43) that
^ (Р«,У*))z-tn> Vy* e grS. (45)
Then, we obtain
ф (4) = sup Ke (F (x*. y*))i < en, Vy* e grS. (46) Hence,
lim sup ф(х*)<0, since en —> 0. (47)
Therefore, {xn} is a type I LP minimizing sequence for (BVOPEC).
Conversely, assume that {x**} is any type I LP minimizing sequence for (BVOPEC). Then, d(x**, grS) ^ 0,
lim sup п^^фЮ < 0, and f(xn,yn,zn) + $ne(xn) t
- int C(xn), Vyn e K2(x,z). Then, there exist {en} > 0 with en ^ 0 satisfying d(x*, grS) < en;
ф(х1) = sup К (F(x**l,y*))}<en, Vy* e grS. (48)
Then, we get ^e(F(x**, у* )) > -еп or, equivalently,
F(xn>yl + ene(xn)t- int C(x*n), Vy e grS. (49)
Hence, {x*} is a type I LP approximating solution sequence for (BVEPEC). It follows that (BVEPEC) is the type I LP well-posedness if and only if (BVOPEC) is the type I LP well-posedness with the function ф.
The proof of (ii) is similar to (i) and we are omitted. This completes the proof. □
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 Commission on Higher Education for financial support. Moreover, Kamonrat Som-but is also supported by The Strategic Scholarships Fellowships Frontier Research Networks under Grant no. CHE-Ph.D-THA-SUP/86/2550, Thailand.
References
[1] A. N. Tikhonov, "On the stability of the functional optimization problem," USSR Computational Mathematics and Mathematical Physics, vol. 6, no. 4, pp. 28-33,1966.
[2] E. S. Levitin and B. T. Polyak, "Convergence of minimizing sequences in conditional extremum problems," Soviet Mathematics Doklady, vol. 7, pp. 764-767,1966.
[3] Y.-P. Fang and R. Hu, "Parametricwell-posednessforvariational inequalities defined by bifunctions," Computers & Mathematics with Applications, vol. 53, no. 8, pp. 1306-1316, 2007.
[4] M. B. Lignola and J. Morgan, "Well-posedness for optimization problems with constraints defined by variational inequalities having a unique solution," Journal of Global Optimization, vol. 16, no. 1, pp. 57-67, 2000.
[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, Recent Developments in Well-Posed Variational Problems, Kluwer Academic, Dordrecht, The Netherlands, 1995.
[7] R. Lucchetti and F. Patrone, "A characterization of Tyhonov well-posedness for minimum problems, with applications to variational inequalities," Numerical Functional Analysis and Optimization, vol. 3, no. 4, pp. 461-476,1981.
[8] R. Lucchetti and F. Patrone, "Hadamard and Tyhonov well-posedness of a certain class of convex functions," Journal of Mathematical Analysis and Applications, vol. 88, no. 1, pp. 204215, 1982.
[9] M. Margiocco, F. Patrone, and L. Pusillo Chicco, "A new approach to Tikhonov well-posedness for Nash equilibria," Optimization, vol. 40, no. 4, pp. 385-400,1997.
[10] M. Margiocco, F. Patrone, and L. Pusillo Chicco, "Metric characterizations of Tikhonov well-posedness in value," Journal of Optimization Theory and Applications, vol. 100, no. 2, pp. 377387,1999.
[11] M. Margiocco, F. Patrone, and L. Pusillo, "On the Tikhonov well-posedness of concave games and Cournot oligopoly games," Journal of Optimization Theory and Applications, vol. 112, no. 2, pp. 361-379, 2002.
[12] J. Morgan, "Approximations and well-posedness in multicriteria games," Annals of Operations Research, vol. 137, pp. 257-268, 2005.
[13] 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.
[14] G. Beer and R. Lucchetti, "The epi-distance topology: continuity and stability results with applications to convex optimization problems," Mathematics of Operations Research, vol. 17, no. 3, pp. 715-726, 1992.
[15] 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.
[16] 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.
[17] N.-J. Huang, X.-J. Long, and C.-W. Zhao, "Well-posedness for vector quasi-equilibrium problems with applications," Journal of Industrial and Management Optimization, vol. 5, no. 2, pp. 341-349, 2009.
[18] M. H. Li, S. J. Li, and W. Y. Zhang, "Levitin-Polyak well-posedness of generalized vector quasi-equilibrium problems," Journal of Industrial and Management Optimization, vol. 5, no. 4, pp. 683-696, 2009.
[19] J. V. Outrata, "A generalized mathematical program with equilibrium constraints," SIAM Journal on Control and Optimization, vol. 38, no. 5, pp. 1623-1638, 2000.
[20] B. S. Mordukhovich, "Characterizations of linear suboptimal-ity for mathematical programs with equilibrium constraints," Mathematical Programming, vol. 120, no. 1, pp. 261-283, 2009.
[21] M. B. Lignola and J. Morgan, "a-well-posedness for Nash equilibria and for optimization problems with Nash equilibrium constraints," Journal of Global Optimization, vol. 36, no. 3, pp. 439-459, 2006.
[22] T. Q. Bao, P. Gupta, and B. S. Mordukhovich, "Necessary conditions in multiobjective optimization with equilibrium constraints," Journal of Optimization Theory and Applications, vol. 135, no. 2, pp. 179-203, 2007.
[23] L. Q. Anh, P. Q. Khanh, and D. T. M. Van, "Well-posedness under relaxed semicontinuity for bilevel equilibrium and optimization problems with equilibrium constraints," Journal of Optimization Theory and Applications, vol. 153, no. 1, pp. 42-59, 2012.
[24] Q. H. Ansari, "Vector equilibrium problems and vector varia-tional inequalities," in Vector Variational Inequalities and Vector Equilibria, F. Giannessi, Ed., Mathematical Theories, p. 116, Kluwer, Dordrecht, The Netherlands, 2000.
[25] F. Giannessi, Ed., Vector Variational Inequalities and Vector Equilibria, vol. 38 of Nonconvex Optimization and its Applications, Kluwer Academic, Dordrecht, The Netherlands, 2000.
[26] G. Y. Chen, X. Q. Yang, and H. Yu, "A nonlinear scalarization function and generalized quasi-vector equilibrium problems," Journal of Global Optimization, vol. 32, no. 4, pp. 451-466,2005.
[27] 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.
[28] S. J. Li, K. L. Teo, X. Q. Yang, and S. Y. Wu, "Gap functions and existence of solutions to generalized vector quasi-equilibrium problems," Journal of Global Optimization, vol. 34, no. 3, pp. 427-440, 2006.
[29] Q. H. Ansari and F. Flores-Bazcn, "Generalized vector quasi-equilibrium problems with applications," Journal of Mathematical Analysis and Applications, vol. 277, no. 1, pp. 246-256,2003.
[30] M. Bianchi, N. Hadjisavvas, and S. Schaible, "Vector equilibrium problems with generalized monotone bifunctions," Journal of Optimization Theory and Applications, vol. 92, no. 3, pp. 527-542,1997.
[31] W. Song, "On generalized vector equilibrium problems," Applied Mathematics Letters, vol. 12, pp. 53-56, 2002.
[32] C. Kuratowski, Topology. Panstwowe Wydawnicto Naukowa, vol. 1, Warszawa, Poland, 1958.
[33] J. Danes, "On the Istratescu measure of noncompactness," Bulletin Mathématique de la Société des Sciences Mathematiques de Roumanie, vol. 16, no. 4, pp. 403-406,1972.
[34] J. Banas and K. Goebel, Measures of Noncompactness in Banach Spaces,vol. 60 of Lecture Notes in Pure and Applied Mathematics, Marcel Dekker, New York, NY, USA, 1980.
[35] V. Rakocevic, "Measures of noncompactness and some applications," Filomat, no. 12, pp. 87-120,1998.
[36] G.-Y. Chen, X. Huang, and X. Yang, Vector Optimization, Set-Valued and Variational Analysis, vol. 541 of Lecture Notes in Economics and Mathematical Systems, Springer, Berlin, Germany, 2005.
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.
