On the connectedness of the set of weakly efficient points of a vector optimization problem in locally convex spaces

DOI10.1007/BF01102345zbMath0674.90090MaRDI QIDQ1121804

Siegfried Helbig

Publication date: 1990

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

zbMATH Keywords

vector optimizationlocally convex spacevector approximationclosed convex coneconnectedness resultsgeneralized convex mappingslower level-setspointwise quasiconvex mappingweak efficient points

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Programming in abstract spaces (90C48) Convexity of real functions of several variables, generalizations (26B25)

Related Items

On a constructive approximation of the efficient outcomes in bicriterion vector optimization, Connectedness of the efficient solution sets for a strictly path quasiconvex programming problem, On connectedness of efficient solution sets for a star cone-quasiconvex vector optimization problem, Connectedness of the efficient solution set of a convex vector optimization in normed spaces, A Fourth bibliography of fractional programming, The balance space approach to multicriteria decision making -- involving the decision maker., Connectedness of efficient solutions in multiple objective combinatorial optimization, Some properties of approximate solutions for vector optimization problem with set-valued functions, Connectedness of cone-efficient solution set for cone-quasiconvex multiobjective programming in locally convex spaces, Stability in disjunctive linear optimization I: continuity of the feasible set, On the contractibility and connectedness of an efficient point set., Connectedness of efficient solutions in multiple criteria combinatorial optimization

Cites Work

• Parametric approximation problems arising in vector optimization
• 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 point sets in quasiconcave vector maximization
• Ordered linear spaces
• On the connectedness of the set of efficient points n convex optimization problems with multiple or random Objectives
• Connectedness in Multiple Linear Fractional Programming
• Generalized Quasiconvex Mappings and Vector Optimization
• Structure of the Efficient Point Set
• Pareto efficiency in locally convex spaces i
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item