Geometrical characterization of weakly efficient points

DOI10.1007/BF02192255zbMATH Open0866.90106MaRDI QIDQ2565009FDOQ2565009

Authors: Frank Plastria, Emilio Carrizosa 

Publication date: 7 January 1997

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

zbMATH Keywords

geometrical characterizationconstrained convex multiobjective optimizationset of weakly efficient points

Mathematics Subject Classification ID

Convex programming (90C25) Multi-objective and goal programming (90C29)

Cites Work

• Convex Analysis
• Theory of multiobjective optimization
• Title not available (Why is that?)
• On Efficient Solutions to Multiple Objective Mathematical Programs
• Optimality conditions in multiobjective differentiable programming
• Maximal vectors and multi-objective optimization
• Pshenichnyi's theorem for vector minimization
• A gap between multiobjective optimization and scalar optimization

Cited In (8)

• Quasiconvex constrained multicriteria continuous location problems: structure of nondominated solution sets
• A characterization of efficient points in constrained location problems with regional demand
• Generalized \(\varepsilon \)-quasi-solutions in multiobjective optimization problems: existence results and optimality conditions
• Characterizations of efficiency in vector optimization with \(\mathcal C(T)\)-valued mappings
• Characterization of weakly efficient points
• On the structure of the weakly efficient set for quasiconvex vector minimization
• Characterizations of efficient and weakly efficient points in nonconvex vector optimization
• Efficiency in constrained continuous location

This page was built for publication: Geometrical characterization of weakly efficient points

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2565009)