An inner approximation method incorporating a branch and bound procedure for optimization over the weakly efficient set

DOI10.1016/S0377-2217(00)00297-6zbMath1007.90055OpenAlexW2076997507MaRDI QIDQ5946143

Tetsuzo Tanino, Masahiro Inuiguchi, Syuuji Yamada

Publication date: 10 December 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(00)00297-6

zbMATH Keywords

global optimizationdual problemweakly efficient setbranch and bound procedureinner approximation method

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)

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 ⋮ The price of multiobjective robustness: analyzing solution sets to uncertain multiobjective problems ⋮ Solving Optimization Problems over the Weakly Efficient Set

Cites Work

• Theory of multiobjective optimization
• Optimization on low rank nonconvex structures
• Point-to-Set Maps in Mathematical Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An inner approximation method incorporating a branch and bound procedure for optimization over the weakly efficient set