Connectedness in vector equilibrium problems involving cones with possibly empty interior

DOI10.1016/j.orl.2015.12.018zbMath1408.90277OpenAlexW2229054195MaRDI QIDQ1785737

Pham Hu'u Sach

Publication date: 1 October 2018

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2015.12.018

zbMATH Keywords

connectednessefficient solutionset-valued mapvector equilibrium problemproper cone-quasiconvexity

Mathematics Subject Classification ID

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) Programming in abstract spaces (90C48)

Related Items (1)

Connectedness of solution sets for generalized vector equilibrium problems via free-disposal sets in complete metric space

Cites Work

• Unnamed Item
• Unnamed Item
• Ekeland's principle for vector equilibrium problems
• Connectedness of the set of efficient solutions for generalized systems
• Connectedness of the solution sets and scalarization for vector equilibrium problems
• Lagrange multipliers for \(\varepsilon \)-Pareto solutions in vector optimization with nonsolid cones in Banach spaces
• Images of connected sets by semicontinuous multifunctions
• Characterizing efficiency on infinite-dimensional commodity spaces with ordering cones having possibly empty interior
• The Geometry of Strict Maximality
• Efficiency and Henig efficiency for vector equilibrium problems.
• On the connectedness of the solution set for the weak vector variational inequality

This page was built for publication: Connectedness in vector equilibrium problems involving cones with possibly empty interior