Connectedness of cone-efficient solution set for cone-quasiconvex multiobjective programming in locally convex spaces
From MaRDI portal
Publication:705084
DOI10.1007/s10255-004-0169-8zbMath1138.90479MaRDI QIDQ705084
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
connectedness; Multiobjective programming; cone-efficient solution; cone-quasiconvex mapping; generalized saddle theorem
Related Items
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
