Mathematical programming problems dealing with functions, each of which can
be represented as a difference of two convex functions, are called DC prog
ramming problems. The purpose of this overview is to discuss main theoretic
al results, some applications, and solution methods for this interesting an
d important class of programming problems. Some modifications and new resul
ts on the optimality conditions and development of algorithms are also pres
ented.