Optimality conditions for DC programming problems with reverse convex constraints

In this paper, we give necessary and sufficient optimality conditions for DC programming problems with reverse convex constraints defined by a finite family of pseudoconvex functions. As application, we obtain necessary and sufficient optimality conditions for DC programming problems and fractional programming problems.