Proper efficiency in nonconvex vector-maximization-problems

DOI10.1016/0377-2217(91)90324-OzbMath0746.90060OpenAlexW2022704122MaRDI QIDQ1179009

Marc Pirlot, Khalid Belkeziz

Publication date: 26 June 1992

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

Full work available at URL: https://doi.org/10.1016/0377-2217(91)90324-o

zbMATH Keywords

vector optimizationnonconvex setsproperly efficient points

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29)

Related Items (2)

Estimating aspiration levels from discrete choices -- computational techniques and experiences ⋮ On the properly efficient points of nonconvex sets

Cites Work

• Unnamed Item
• Unnamed Item
• On the convexification of nonlinear programming problems: An applications-oriented survey
• Pre-invex functions in multiple objective optimization
• An improved definition of proper efficiency for vector maximization with respect to cones
• Compromise solutions and estimation of the noninferior set
• Properly efficient and efficient solutions for vector maximization problems in Euclidean space
• Proper efficiency and the theory of vector maximization
• Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
• A Characterization of Properly Minimal Elements of a Set
• Proper Efficient Points for Maximizations with Respect to Cones
• Strictly Concave Parametric Programming, Part II: Additional Theory and Computational Considerations

This page was built for publication: Proper efficiency in nonconvex vector-maximization-problems