Connectedness of the efficient set of strictly quasiconcave sets

DOI10.1023/A:1022616612527zbMath0907.90227OpenAlexW128572285MaRDI QIDQ1264975

K. Appert

Publication date: 11 February 1999

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

Full work available at URL: https://doi.org/10.1023/a:1022616612527

zbMATH Keywords

vector optimizationefficient pointsconnected setsstrictly quasiconvex functionsstrictly quasiconvex sets

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Related Items (22)

Proper efficiency in linear fractional vector optimization via Benson's characterization ⋮ Unbounded components in the solution sets of strictly quasiconcave vector maximization problems ⋮ Computing the Pareto frontier of a bi-objective bi-level linear problem using a multiobjective mixed-integer programming algorithm ⋮ Explicitly quasiconvex set-valued optimization ⋮ Some remarks on the class of continuous (semi-)strictly quasiconvex functions ⋮ New results on proper efficiency for a class of vector optimization problems ⋮ Connectedness of cone superefficient point sets in locally convex topological vector spaces ⋮ Contractibility of the solution sets in strictly quasiconcave vector maximization on noncompact domains ⋮ Maximizing a linear fractional function on a Pareto efficient frontier ⋮ Connectedness of cone-efficient solution set for cone-quasiconvex multiobjective programming in locally convex spaces ⋮ Geoffrion's proper efficiency in linear fractional vector optimization with unbounded constraint sets ⋮ On the contractibility and connectedness of an efficient point set. ⋮ Contractibility of the efficient frontier of three-dimensional simply-shaded sets. ⋮ S-strictly quasi-concave vector maximisation ⋮ A note on the connectedness of the efficient frontier ⋮ Connectedness of efficient points in convex and convex transformable vector optimization ⋮ Characterization of nonsmooth semistrictly quasiconvex and strictly quasiconvex functions ⋮ Axiomatic approach to approximate solutions in multiobjective optimization ⋮ The structure of the efficient frontier of finite-dimensional completely-shaded sets ⋮ Unnamed Item ⋮ Contractibility of the efficient set in strictly quasiconcave vector maximization ⋮ Variational Problem, Generalized Convexity, and Application to a Competitive Equilibrium Problem

Cites Work

• Unnamed Item
• Unnamed Item
• Existence of equilibria when firms follow bounded losses pricing rules
• 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
• The structure of admissible points with respect to cone dominance
• 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
• Connectedness of the efficient point sets in quasiconcave vector maximization
• On the connectedness of the efficient set for strictly quasiconvex vector minimization problems
• Connectedness in Multiple Linear Fractional Programming
• Connectedness of the efficient solution sets for a strictly path quasiconvex programming problem
• Seven Kinds of Convexity

This page was built for publication: Connectedness of the efficient set of strictly quasiconcave sets