Hoang Tuy and Nguyen Duc Nghia
 

Abstract
A decomposition method is proposed for reversex programs with a special low rank nonconvex structure. When specialized to linear programs with an additional reverse convex constraint, this method gives an improved vesion
of the polyhedral annexation method earlier developed by the first author for reverse convex programs.