An inner approximation method for optimization over the weakly efficient set

DOI10.1023/A:1008336124425zbMath0962.90042OpenAlexW1527225905MaRDI QIDQ1580428

Masahiro Inuiguchi, Syuuji Yamada, Tetsuzo Tanino

Publication date: 21 June 2001

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

Full work available at URL: https://doi.org/10.1023/a:1008336124425

zbMATH Keywords

global optimizationdual problemweakly efficient setinner approximation method

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (4)

Optimizing over the properly efficient set of convex multi-objective optimization problems ⋮ An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem ⋮ Biconvex programming approach to optimization over the weakly efficient set of a multiple objective affine fractional problem ⋮ The price of multiobjective robustness: analyzing solution sets to uncertain multiobjective problems

This page was built for publication: An inner approximation method for optimization over the weakly efficient set