On localizing global Pareto solutions in a given convex set

DOI10.4064/AM-26-4-383-394MaRDI QIDQ4522977zbMATH OpenOpenAlexFDO

Authors A. Drwalewska, L. Gajek

Publication date 7 January 2001

Published in Applicationes Mathematicae (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/219247

zbMATH Keywords

Pareto optimal solutionsdual conesfeasible directions

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions for problems in abstract spaces (49K27)

Recommendations

• scientific article; zbMATH DE number 3876940
• Sufficient conditions for global weak Pareto solutions in multiobjective optimization
• Existence of Pareto-optimal solutions to the vector optimization problem with an unbounded feasible set
• Optimality conditions for multiobjective programming with generalized \(({\mathfrak J},\rho,\theta)\)-convex set functions
• On the number of criteria needed to decide Pareto optimality

Cited in

(5)

• Local completeness and Pareto optimization
• Detecting local convexity on the pareto surface
• Localization sets for Pareto eigenvalues with applications
• On Pareto dominance in decomposably antichain-convex sets
• Properties of pareto sets in locally convex spaces

This page was built for publication: On localizing global Pareto solutions in a given convex set

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