On the use of cuts in reverse convex programs
A cutting method, using the idea of Tuy cuts, has been suggested in earlier papers as a possible means of solving reverse convex programs. However, the method is fraught with theoretical and numerical difficulties. Stringent sufficient conditions for convergence in n dimensions are given. However, examples of nonconvergence are given and reasons for this nonconvergence are developed. A result of the discussion is a convergent algorithm which combines the idea of the cutting plane method with vertex enumeration procedures in order to numerically improve upon the edge search procedure of \textit{R. J. Hillestad} [see Oper. Res. 23, 1091-1098 (1975; Zbl 0335.90039)].
scientific article; zbMATH DE number 4147873