Polyhedral annexation vs outer approximation for the decomposition of monotonic quasiconcave minimization problems
From MaRDI portal
Publication:1376657
zbMath0885.90103MaRDI QIDQ1376657
Publication date: 22 April 1998
Published in: Acta Mathematica Vietnamica (Search for Journal in Brave)
outer approximationpolyhedral annexationdecomposition of linearly constrained quasiconcave minimization
Related Items (2)
Beyond canonical dc-optimization: the single reverse polar problem ⋮ Outer approximation algorithms for canonical DC problems
This page was built for publication: Polyhedral annexation vs outer approximation for the decomposition of monotonic quasiconcave minimization problems