| Article ID: | iaor1997692 |
| Country: | Netherlands |
| Volume: | 18 |
| Issue: | 2 |
| Start Page Number: | 99 |
| End Page Number: | 106 |
| Publication Date: | Oct 1995 |
| Journal: | Operations Research Letters |
| Authors: | Tuy Hoang |
For solving the canonical DC programming problem (i.e. a convex program with an additional reverse convex constraint) several cutting plane procedures have been developed in the past few years which suffer from serious defects regarding efficiency or convergence. The authors discuss a general conceptual framework of outer approximation unifying various conjunctive cutting plane approaches and on this basis propose modifications to overcome these defects.