Finding efficient solutions by free disposal outer approximation

DOI10.1137/09075648XMaRDI QIDQ3083315zbMATH OpenOpenAlexFDO

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 solutionnonconvex multiobjective problemscalarization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) 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

(7)

• A Benson type algorithm for nonconvex multiobjective programming problems
• Obtaining an outer approximation of the efficient set of nonlinear biobjective problems
• Set Optimization—A Rather Short Introduction
• Solving generalized convex multiobjective programming problems by a normal direction method
• A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
• 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
• On cutting plane algorithms for nonlinear binary optimization

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)