Extremal problems with d.c.-contraints. (Q1395156)

The paper is centred on nonconvex mathematical programming problems in which one of the inequality constraints is given by a difference of two convex functions (i.e., by a d.c.-function). Necessary and sufficient conditions for a global solution are obtained. In addition, these conditions possess the so-called algorithmic property, which allows the construction of computational method for finding a global solution in problems with d.c.-constraints.