An outer approximation algorithm guaranteeing feasibility of solutions and approximate accuracy of optimality

DOI10.1023/A:1008343426871zbMath0948.90121OpenAlexW1521575568MaRDI QIDQ1304754

Tamaki Tanaka, Syuuji Yamada

Publication date: 22 September 1999

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

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

zbMATH Keywords

global optimizationcutting plane methodconcave programmingouter approximation methodsupporting hyperplane methodcompact convex feasible set

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)

This page was built for publication: An outer approximation algorithm guaranteeing feasibility of solutions and approximate accuracy of optimality