Finding Efficient Solutions by Free Disposal Outer Approximation

DOI10.1137/09075648XzbMath1229.90177OpenAlexW2024752222MaRDI QIDQ3083315

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

scalarizationefficient solutionnonconvex multiobjective problem

Mathematics Subject Classification ID

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

Related Items (4)

A Benson type algorithm for nonconvex multiobjective programming problems ⋮ A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization ⋮ Set Optimization—A Rather Short Introduction ⋮ 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