Abstract:
We consider a quadratic d. c. optimization problem on a convex set. The objective function is represented as the difference of two convex functions. By reducing the problem to the equivalent concave programming problem we prove a sufficient optimality condition in the form of an inequality for the directional derivative of the objective function at admissible points of the corresponding level surface.
Keywords:d. c.-maximization problem, necessary and sufficient optimality conditions.