Connectedness of cone-efficient solution set for cone-quasiconvex multiobjective programming in locally convex spaces

DOI10.1007/s10255-004-0169-8zbMath1138.90479OpenAlexW2083563308MaRDI QIDQ705084

Xuanwei Zhou, Yu-Da Hu

Publication date: 25 January 2005

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-004-0169-8

zbMATH Keywords

connectednessMultiobjective programmingcone-efficient solutioncone-quasiconvex mappinggeneralized saddle theorem

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Programming in abstract spaces (90C48)

Related Items (1)

On connectedness of efficient solution sets for a star cone-quasiconvex vector optimization problem

Cites Work

• On general minimax theorems
• On the connectedness of the set of weakly efficient points of a vector optimization problem in locally convex spaces
• Bicriteria linear fractional programming
• Quasiconcave vector maximization: Connectedness of the sets of Pareto- optimal and weak Pareto-optimal alternatives
• Connectedness of the set of nondominated outcomes in multicriteria optimization
• Connectedness of the efficient set of strictly quasiconcave sets
• Connectedness of the efficient set in strictly quasiconcave vector maximization
• Connectedness of efficient solution sets for set-valued maps in normed spaces
• Connectedness of the efficient set for three-objective quasiconcave maximization problems
• On the connectedness of the efficient set for strictly quasiconvex vector minimization problems
• Ordered linear spaces
• Connectedness of cone superefficient point sets in locally convex topological vector spaces

This page was built for publication: Connectedness of cone-efficient solution set for cone-quasiconvex multiobjective programming in locally convex spaces