An inner approximation method for optimization over the weakly efficient set
From MaRDI portal
Publication:2753338
zbMATH Open0987.90073MaRDI QIDQ2753338
Syuuji Yamada, Tetsuzo Tanino, Masahiro Inuiguchi
Publication date: 4 June 2002
dual problemmultiobjective programmingweakly efficient setinner approximation methodconvex cost function
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (6)
An algorithm for optimizing over the weakly-efficient set ⋮ Applying set optimization to weak efficiency ⋮ Title not available (Why is that?) ⋮ An inner approximation method incorporating a branch and bound procedure for optimization over the weakly efficient set ⋮ On minimization over weakly efficient sets ⋮ Solving Optimization Problems over the Weakly Efficient Set
This page was built for publication: An inner approximation method for optimization over the weakly efficient set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2753338)
