Existence and characterization of efficient decisions with respect to cones

DOI10.1007/BF01583782zbMath0477.90076MaRDI QIDQ3934164

Mordechai I. Henig

Publication date: 1982

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

existenceconesconvex analysismulticriteria optimizationcharacterization theoremscompactness conditionsefficient nondominated set of decisions

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Related Items

Generalized quasiconvexities, cone saddle points, and minimax theorem for vector-valued functions ⋮ Existence and continuity of solutions for vector optimization ⋮ On existence of cone-maximal points in real topological linear spaces ⋮ A general cone decomposition theory based on efficiency ⋮ On the existence of maximal elements for partial preorders ⋮ Some minimax problems of vector-valued functions ⋮ The domination property in multicriteria optimization ⋮ A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions ⋮ Existence theorems for cone saddle points of vector-valued functions in infinite-dimensional spaces ⋮ Characterizations of the nonemptiness and compactness of solution sets in convex vector optimization ⋮ On efficient solutions in vector optimization ⋮ Positive definiteness of high-order subdifferential and high-order optimality conditions in vector optimization problems ⋮ Existence of solutions for vector optimization on Hadamard manifolds ⋮ Multiple-objective programming with polynomial objectives and constraints ⋮ Convexity of the optimal multifunctions and its consequences in vector optimization ⋮ Proximal proper efficiency for minimisation with respect to normal cones ⋮ Continuous dependence of solutions on a parameter in a scalarization method ⋮ Comparison of existence results for efficient points ⋮ The Fermat rule for multifunctions on Banach spaces ⋮ On the domination property in vector optimization

Cites Work

• Unnamed Item
• Unnamed Item
• An improved definition of proper efficiency for vector maximization with respect to cones
• The set of all nondominated solutions in linear cases and a multicriteria simplex method
• The structure of admissible points with respect to cone dominance
• Dynamic programming in multiplicative lattices
• Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
• The geometry of Pareto efficiency over cones
• Proper Efficient Points for Maximizations with Respect to Cones
• On Cone-Efficiency, Cone-Convexity and Cone-Compactness
• State Constraints in Convex Control Problems of Bolza