Computation of efficient compromise arcs in convex quadratic multicriteria optimization

DOI10.1007/S10898-004-0573-XMaRDI QIDQ813340zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Arcwise cone-quasiconvex multicriteria optimization
• Optimization of a linear function on the set of efficient solutions of a multicriterion convex quadratic problem
• Analytic efficient solution set for multi-criteria quadratic programs
• The power of compromise. Reference point methods and approximation in multicriteria optimization
• scientific article; zbMATH DE number 1328997

Cites work

• scientific article; zbMATH DE number 4010155 (Why is no real title available?)
• scientific article; zbMATH DE number 3069632 (Why is no real title available?)
• scientific article; zbMATH DE number 3078986 (Why is no real title available?)
• A reduced gradient method for quadratic programs with quadratic constraints and \(l_ p-\)constrained \(l_ p-\)approximation problems
• A successive projection method
• Efficient solution concepts and their relations in stochastic multiobjective programming
• Existence of efficient solutions for vector maximization problems
• Proper efficiency and the theory of vector maximization
• The domination property in multicriteria optimization

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

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