"Convexity" or "Tui" cuts are combined with the support cuts of Kelley's cutting plane algorithm to solve a large class of nonconvex programming problems. This class is defined by problems with some constraints of the "reverse convex" variety, that ...
