| Article ID: | iaor20002406 |
| Country: | United States |
| Volume: | 103 |
| Issue: | 1 |
| Start Page Number: | 1 |
| End Page Number: | 43 |
| Publication Date: | Oct 1999 |
| Journal: | Journal of Optimization Theory and Applications |
| Authors: | Thoai N.V., Horst R. |
| Keywords: | programming: convex |
Mathematical programming problems dealing with functions, each of which can be represented as a difference of two convex functions, are called DC programming problems. The purpose of this overview is to discuss main theoretical results, some applications, and solution methods for this interesting and important class of programming problems. Some modifications and new results on the optimality conditions and development of algorithms are also presented.