A cutting plane algorithm for linear reverse convex programs

DOI10.1023/A:1013361800945zbMath1012.90041OpenAlexW1584030529MaRDI QIDQ5959333

Mahyar A. Amouzegar, Khosrow Moshirvaziri

Publication date: 26 March 2002

Published in: Annals of Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

global optimizationnonconvex programmingcutting plane techniquesreverse convex programming problem

Mathematics Subject Classification ID

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

Related Items (1)

The complexity results of the sparse optimization problems and reverse convex optimization problems

This page was built for publication: A cutting plane algorithm for linear reverse convex programs