抄録
In this paper, we consider a DC programming problem constrained by a convex set and a reverse convex set which is defined by the complement of the interior of a compact convex set X. When X is not necessarily a polytope, we propose an inner approximation method. The algorithm utilizes inner approximation of X by a sequence of polytopes to generate relaxed problems. Then, every accumulation point of the sequence of optimal solutions of relaxed problems is an optimal solution of the original problem.
