Some geometrical aspects of the efficient line in vector optimization

DOI10.1016/j.ejor.2003.06.029zbMath1120.90053MaRDI QIDQ706931

Maria E. Ballvé, Pedro Jiménez Guerra

Publication date: 9 February 2005

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2003.06.029

zbMATH Keywords

Vector optimization; Extreme points; Ideal points; Denting points; Minimal points

Mathematics Subject Classification ID

90C29: Multi-objective and goal programming

Related Items

Conic set-valued maps in vector optimization, Some characterizations of ideal points in vector optimization problems, Polar conic set-valued map in vector optimization. Continuity and derivability

Cites Work

• Theory of multiobjective optimization
• Compromise solutions and estimation of the noninferior set
• Compromise solutions, domination structures, and Salukvadze's solution
• A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions
• Density of the set of positive proper minimal points in the set of minimal points
• Sensitivity analysis for convex multiobjective programming in abstract spaces
• Density theorems for ideal points in vector optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item