Polyhedral annexation vs outer approximation for the decomposition of monotonic quasiconcave minimization problems

MaRDI QIDQ1376657zbMATH OpenFDO

Authors Hoang Tuy, Bui The Tam

Publication date 22 April 1998

Published in Acta Mathematica Vietnamica (Search for Journal in Brave)

zbMATH Keywords

decomposition of linearly constrained quasiconcave minimizationouter approximationpolyhedral annexation

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Recommendations

• On the minimization of a quasi-concave function subject to linear constraints
• Concave minimization under linear constraints with special structure
• Decomposition approach for the global minimization of biconcave functions over polytopes
• Concave minimization via conical partitions and polyhedral outer approximation
• On outer approximation methods for solving concave minimization problems

Cited in

(3)

• Polyhedral annexation, dualization and dimension reduction technique in global optimization
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1376657)