Connectedness of efficient solution sets for set-valued maps in normed spaces

DOI10.1007/BF02191763zbMath0845.90104MaRDI QIDQ1337208

V. Pereyra

Publication date: 16 September 1996

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

vector optimizationconnectedness of efficient setspoint-to-set functionstheorem of Arrow-Barankin and Blackwell

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Set-valued maps in general topology (54C60) Programming in abstract spaces (90C48)

Related Items (40)

The Strictly Efficient Subgradient of Set-Valued Optimisation ⋮ Density of the set of positive proper minimal points in the set of minimal points ⋮ A new ABB theorem in normed vector spaces ⋮ On connectedness of efficient solution sets for a star cone-quasiconvex vector optimization problem ⋮ Connectedness of weak minimal solution set for set optimization problems ⋮ Cones admitting strictly positive functionals and scalarization of some vector optimization problems ⋮ Generalizations of a theorem of Arrow, Barankin, and Blackwell in topological vector spaces ⋮ A note on connectivity of efficient solution sets ⋮ Restricted coherent risk measures and actuarial solvency ⋮ Connectedness of approximate efficient solutions for generalized semi-infinite vector optimization problems ⋮ Connectedness of Henig weakly efficient solution set for set-valued optimization problems ⋮ Some characterizations of the approximate solutions to generalized vector equilibrium problems ⋮ Efficiencies and Pareto efficiencies of set-valued mappings on ordered spaces ⋮ Connectedness of the solution sets in generalized semi-infinite set optimization ⋮ Subdifferentials of multifunctions and Lagrange multipliers for multiobjective optimization. ⋮ Optimality conditions for proper efficient solutions of vector set-valued optimization. ⋮ Weak Henig proper solution sets for set optimization problems ⋮ Connectivity of efficient solution sets in vector optimization of set-valued mappings ⋮ \(\varepsilon\)-subdifferentials of set-valued maps and \(\varepsilon\)-weak Pareto optimality for multiobjective optimization ⋮ Superefficiency in vector optimization with nearly subconvexlike set-valued maps ⋮ Existence and connectedness of solutions for generalized vector quasi-equilibrium problems ⋮ Set-valued derivatives of multifunctions and optimality conditions ⋮ Upper and lower semicontinuity for set-valued mappings involving constraints ⋮ Efficiency and Henig efficiency for vector equilibrium problems. ⋮ Topological properties of Henig globally efficient solutions of set-valued problems ⋮ Connectedness of cone-efficient solution set for cone-quasiconvex multiobjective programming in locally convex spaces ⋮ Efficient sets of convex compacta are arcwise connected ⋮ A New Abb Theorem In Banach Spaces ⋮ The connectedness of the solutions set for generalized vector equilibrium problems ⋮ On the contractibility and connectedness of an efficient point set. ⋮ Arcwise connectedness of the solution sets for set optimization problems ⋮ Connectedness of the efficient set of strictly quasiconcave sets ⋮ Benson proper efficiency in the vector optimization of set-valued maps ⋮ Contractibility and connectedness of efficient point sets ⋮ Arcwise connectedness of closed efficient point sets ⋮ Limit Behavior of Approximate Proper Solutions in Vector Optimization ⋮ Characterization of solutions of multiobjective optimization problem ⋮ New notions of proper efficiency in set optimization with the set criterion ⋮ The restricted convex risk measures in actuarial solvency ⋮ Connectedness of the approximate solution sets for set optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Existence and Lagrangian duality for maximization of set-valued functions
• Theorems of the alternative for multifunctions with applications to optimization: General results
• 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
• The structure of admissible points with respect to cone dominance
• A general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processes
• Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
• On a Theorem of Arrow, Barankin, and Blackwell
• Positive Proper Efficient Points and Related Cone Results in Vector Optimization Theory
• A Generalization of a Theorem of Arrow, Barankin, and Blackwell
• Theorems of the alternative for set-valued functions in infinite-dimensional spaces
• The geometry of Pareto efficiency over cones
• On Cone-Efficiency, Cone-Convexity and Cone-Compactness
• Contractibility of efficient point sets in normed spaces
• Optimality conditions for maximizations of set-valued functions

This page was built for publication: Connectedness of efficient solution sets for set-valued maps in normed spaces