Contractibility and connectedness of efficient point sets
From MaRDI portal
Publication:1573996
DOI10.1023/A:1004649928081zbMath0974.90023MaRDI QIDQ1573996
Publication date: 16 December 2001
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
locally convex space; multi-objective programming; contractibility; path connectgedness; weak upper-semicontinuous set valued map
90C29: Multi-objective and goal programming
Cites Work
- Unnamed Item
- Unnamed Item
- Quasiconcave vector maximization: Connectedness of the sets of Pareto- optimal and weak Pareto-optimal alternatives
- Convex functions, monotone operators and differentiability
- Global analysis and economics. V: Pareto theory with constraints
- Connectedness of the set of nondominated outcomes in multicriteria optimization
- Structure of the demand function and Pareto optimal set with natural boundary conditions
- The structure of admissible points with respect to cone dominance
- Connectedness of efficient solution sets for set-valued maps in normed spaces
- Generalizations of a theorem of Arrow, Barankin, and Blackwell in topological vector spaces
- Connectedness of the efficient point sets in quasiconcave vector maximization
- Connectedness in Multiple Linear Fractional Programming
- Structure of the Efficient Point Set
- Super Efficiency in Vector Optimization
- Topological Properties of the Efficient Point Set
- Contractibility of efficient point sets in normed spaces