Pareto solutions of polyhedral-valued vector optimization problems in Banach spaces
type: Item
instance of: scholarly article
title: Pareto solutions of polyhedral-valued vector optimization problems in Banach spaces
zbMATH Open document ID: 1177.49033
author: J. Blot
published in: Set-Valued and Variational Analysis
publication date: 2009-12-11T00:00:00Z
Mathematics Subject Classification ID: 49J53
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 5645724
zbMATH Keywords: vector optimization
zbMATH Keywords: Pareto solution
zbMATH Keywords: weak Pareto solution
zbMATH Keywords: Banach space
MaRDI profile type: Publication
full work available at URL: s11228-009-0120-5
OpenAlex ID: W2080965947
cites work: Finding all maximal efficient faces in multiobjective linear programming
cites work: Q5817859
cites work: Outcome space partition of the weight set in multiobjective linear programming
cites work: The structure of admissible points with respect to cone dominance
cites work: Two Generalizations of a Theorem of Arrow, Barankin, and Blackwell
cites work: The compromise hypersphere for multiobjective linear programming
cites work: Connectedness of the efficient solution set of a convex vector optimization in normed spaces
cites work: Multicriteria planar location problems
cites work: A Generalization of a Theorem of Arrow, Barankin, and Blackwell
cites work: Q4461359
cites work: Ordered linear spaces
cites work: Connectedness of the efficient point sets in quasiconcave vector maximization
cites work: An Existence Theorem in Vector Optimization
cites work: Contractibility of efficient point sets in normed spaces
cites work: Efficient sets of convex compacta are arcwise connected
cites work: On the density of positive proper efficient points in a normed space
cites work: Multiple objective programming with piecewise linear functions
cites work: Management of surgical waiting lists through a possibilistic linear multiobjective programming problem
cites work: On a Theorem of Arrow, Barankin, and Blackwell
cites work: Convex Analysis
cites work: On the connectedness of the efficient set for strictly quasiconvex vector minimization problems
cites work: On sensitivity in linear multiobjective programming
cites work: Quasiconcave vector maximization: Connectedness of the sets of Pareto- optimal and weak Pareto-optimal alternatives
cites work: Linear multiobjective programming
cites work: Contractibility and connectedness of efficient point sets
cites work: The structure of weak Pareto solution sets in piecewise linear multiobjective optimization in normed spaces
DOI: 10.1007/S11228-009-0120-5
description: scientific article; zbMATH DE number 5645724