On a domination property for vector maximization with respect to cones

DOI10.1007/BF00934609zbMath0479.90075MaRDI QIDQ1161684

Harold P. Benson

Publication date: 1983

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

zbMATH Keywords

vector optimization; nondominated points; proper efficiency; efficient points; domination property; maximization with respect to cones; sufficient domination condition

Mathematics Subject Classification ID

90C31: Sensitivity, stability, parametric optimization

Related Items

Extensions of labeling algorithms for multi‐objective uncertain shortest path problems, On the domination property in vector optimization, On efficient sets in vector maximum problems - A brief survey, The domination property in multicriteria optimization, Extension of the Zorn lemma to general nontransitive binary relations, The domination property for efficiency in locally convex spaces, A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions, Recession cones and the domination property in vector optimization, Convexity of the optimal multifunctions and its consequences in vector optimization, On the characterization of efficient points by means of monotone functionals

Cites Work

• Efficiency and proper efficiency in vector maximization with respect to cones
• An improved definition of proper efficiency for vector maximization with respect to cones
• Proper efficiency with respect to cones
• The set of all nondominated solutions in linear cases and a multicriteria simplex method
• Linear multiobjective programming
• Connectedness of the set of nondominated outcomes in multicriteria optimization
• A survey of multicriteria optimization or the vector maximum problem. I: 1776-1960
• The structure of admissible points with respect to cone dominance
• Proper efficiency and the theory of vector maximization
• Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
• Proper Efficient Points for Maximizations with Respect to Cones
• A revised simplex method for linear multiple objective programs
• Algorithms for the vector maximization problem
• Technical Note—Proper Efficiency and the Linear Vector Maximum Problem
• Convex Analysis