Deletion-by-Infeasibility Rule for DC-Constrained Global Optimization

摘要

In Ref. 1, a general class of branch-and-bound methods was proposed by Horst for solving global optimization problems. One of the main contributions of Ref. 1 was the opportunity of handling partition elements whose feasibility is not known. Deletion-by-infeasi-bility rules were presented for problems where the feasible set is convex, is defined by finitely many convex and reverse convex constraints, or is. defined by Lipschitzian inequalities. In this note, we propose a new deletion-by-infeasibility rule for problems whose feasible set is defined by functions representable as differences of convex functions.