scholarly journals LP Well-Posedness for Bilevel Vector Equilibrium and Optimization Problems with Equilibrium Constraints

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Phan Quoc Khanh ◽  
Somyot Plubtieng ◽  
Kamonrat Sombut

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 Istrǎtescus 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.

2015 ◽  
Vol 2015 ◽  
pp. 1-10
Author(s):  
Wei-bing Zhang ◽  
Nan-jing Huang ◽  
Donal O’Regan

We introduce and study well-posedness in connection with the symmetric vector quasi-equilibrium problem, which unifies its Hadamard and Levitin-Polyak well-posedness. Using the nonlinear scalarization function, we give some sufficient conditions to guarantee the existence of well-posedness for the symmetric vector quasi-equilibrium problem.


Mathematics ◽  
2020 ◽  
Vol 8 (1) ◽  
pp. 45
Author(s):  
Wensheng Jia ◽  
Xiaoling Qiu ◽  
Dingtao Peng

In this paper, our purpose is to investigate the vector equilibrium problem of whether the approximate solution representing bounded rationality can converge to the exact solution representing complete rationality. An approximation theorem is proved for vector equilibrium problems under some general assumptions. It is also shown that the bounded rationality is an approximate way to achieve the full rationality. As a special case, we obtain some corollaries for scalar equilibrium problems. Moreover, we obtain a generic convergence theorem of the solutions of strictly-quasi-monotone vector equilibrium problems according to Baire’s theorems. As applications, we investigate vector variational inequality problems, vector optimization problems and Nash equilibrium problems of multi-objective games as special cases.


Sign in / Sign up

Export Citation Format

Share Document