Well-posedness for lexicographic vector quasiequilibrium problems with lexicographic equilibrium constraints
DOI10.1186/s13660-015-0669-5zbMath1384.90098OpenAlexW2149682357WikidataQ59431816 ScholiaQ59431816MaRDI QIDQ262318
Rabian Wangkeeree, Thanatporn Bantaojai, Panu Yimmuang
Publication date: 29 March 2016
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-015-0669-5
well-posednessoptimization problemslexicographic equilibrium constraintslexicographic vector equilibrium problems
Sensitivity, stability, well-posedness (49K40) Multi-objective and goal programming (90C29) Sensitivity, stability, parametric optimization (90C31) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (6)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Well-posedness under relaxed semicontinuity for bilevel equilibrium and optimization problems with equilibrium constraints
- On Hölder calmness of solution mappings in parametric equilibrium problems
- On constructing total orders and solving vector optimization problems with total orders
- Generalized extensive measurement for lexicographic orders
- Uniqueness and Hölder continuity of the solution to multivalued equilibrium problems in metric spaces
- Well-posedness of mixed variational inequalities, inclusion problems and fixed point problems
- Well-posedness for mixed quasivariational-like inequalities
- Lexicographic and sequential equilibrium problems
- Well-posedness for parametric vector equilibrium problems with applications
- Sensitivity analysis for multivalued quasiequilibrium problems in metric spaces: Hölder continuity of solutions
- Hölder continuity of the unique solution to quasiequilibrium problems in metric spaces
- \(\epsilon\)-solutions in vector minimization problems
- A note on stability for parametric equilibrium problems.
- Pseudocontinuity in optimization and nonzero-sum games
- Well-posedness for optimization problems with constraints defined by variational inequalities having a unique solution
- Equilibrium problems with generalized monotone bifunctions and applications to variational inequalities
- Existence of equilibria via Ekeland's principle
- Lexicographically-ordered constraint satisfaction problems
- \(\alpha\)-well-posedness for Nash equilibria and for optimization problems with Nash equilibrium constraints
- Necessary conditions in multiobjective optimization with equilibrium constraints
- Sensitivity analysis for abstract equilibrium problems
- Well-posedness and \(L\)-well-posedness for quasivariational inequalities
- Typical convex program is very well posed
- Existence Theorems for Generalized Noncoercive Equilibrium Problems: The Quasi-Convex Case
- A Generalized Mathematical Program with Equilibrium Constraints
- Lexicographic variational inequalities with applications
- Semicontinuity of the Approximate Solution Sets of Multivalued Quasiequilibrium Problems
- On the stability of the functional optimization problem
- Almost Every Convex or Quadratic Programming Problem Is Well Posed
- Well-Posedness for Lexicographic Vector Equilibrium Problems
- Discontinuous but Well‐Posed Optimization Problems
- Set-valued analysis
This page was built for publication: Well-posedness for lexicographic vector quasiequilibrium problems with lexicographic equilibrium constraints
