Levitin–Polyak Well-Posedness for Optimization Problems with Generalized Equilibrium Constraints

• DOI: 10.1007/s10957-011-9958-4
• Publication Date: 2011-12-03T18:03:35Z
• Authors: G. Wang; X. X. Huang
• Keywords: Theory of computation

In this paper, we consider Levitin–Polyak well-posedness of parametric generalized equilibrium problems and optimization problems with generalized equilibrium constraints. Some criteria for these types of well-posedness are derived. In particular, under certain conditions, we show that generalized Levitin–Polyak well-posedness of a parametric generalized equilibrium problem is equivalent to the nonemptiness and compactness of its solution set. Finally, for an optimization problem with generalized equilibrium constraints, we also obtain that, under certain conditions, Levitin–Polyak well-posedness in the generalized sense is equivalent to the nonemptiness and compactness of its solution set.