Finding efficient solutions by free disposal outer approximation

DOI10.1137/09075648XMaRDI QIDQ3083315zbMATHOpenAlexFDO

Authors Daniel Gourion, Dinh The Luc

Publication date 21 March 2011

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/09075648x

zbMATH Keywords

efficient solutionscalarizationnonconvex multiobjective problem

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Nonconvex programming, global optimization (90C26) Sensitivity, stability, parametric optimization (90C31)

Recommendations

• scientific article; zbMATH DE number 1530351
• An approximation algorithm for convex multi-objective programming problems
• Generating the weakly efficient set of nonconvex multiobjective problems
• Obtaining an outer approximation of the efficient set of nonlinear biobjective problems
• A Procedure to Find Discrete Representations of the Efficient Set with Specified Coverage Errors

Cited in

(6)

• A modified version of a Benson-type algorithm proposed for obtaining solutions with better dispersion on the non-dominated set of a non-convex multi-objective programming problem
• Obtaining an outer approximation of the efficient set of nonlinear biobjective problems
• A Benson type algorithm for nonconvex multiobjective programming problems
• Set Optimization—A Rather Short Introduction
• A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
• Solving generalized convex multiobjective programming problems by a normal direction method

This page was built for publication: Finding efficient solutions by free disposal outer approximation

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