Computation of efficient compromise arcs in convex quadratic multicriteria optimization

DOI10.1007/s10898-004-0573-xzbMath1093.90056OpenAlexW2057456280MaRDI QIDQ813340

N. E. Zubov

Publication date: 8 February 2006

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-004-0573-x

zbMATH Keywords

StabilityMulticriteria optimizationBenson's methodDomination ProblemQuadratic functions

Mathematics Subject Classification ID

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

Cites Work

• The domination property in multicriteria optimization
• A reduced gradient method for quadratic programs with quadratic constraints and \(l_ p-\)constrained \(l_ p-\)approximation problems
• Existence of efficient solutions for vector maximization problems
• A successive projection method
• Proper efficiency and the theory of vector maximization
• Efficient solution concepts and their relations in stochastic multiobjective programming
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computation of efficient compromise arcs in convex quadratic multicriteria optimization