Connectedness of super efficient sets in vector optimization of set-valued maps

DOI10.1007/s001860050023zbMath0928.90081OpenAlexW2609256571MaRDI QIDQ1298717

Zhong-Fei Li, Shou-Yang Wang

Publication date: 5 October 1999

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001860050023

zbMATH Keywords

vector optimizationset-valued mapsupper semicontinuitycone-convexlikenesssuper efficient sets

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Related Items (11)

Higher-order sensitivity analysis in set-valued optimization under Henig efficiency ⋮ Sensitivity analysis in set-valued optimization under strictly minimal efficiency ⋮ Connectedness of weak minimal solution set for set optimization problems ⋮ Connectedness of approximate efficient solutions for generalized semi-infinite vector optimization problems ⋮ Connectedness of Henig weakly efficient solution set for set-valued optimization problems ⋮ Strong duality with super efficiency in set-valued optimization ⋮ Strict efficiency of a multi-product supply-demand network equilibrium model ⋮ Topological properties of Henig globally efficient solutions of set-valued problems ⋮ On the contractibility and connectedness of an efficient point set. ⋮ Arcwise connectedness of the solution sets for set optimization problems ⋮ Connectedness of the approximate solution sets for set optimization problems

This page was built for publication: Connectedness of super efficient sets in vector optimization of set-valued maps