A branch and bound algorithm for solving a class of D-C programming
A special class of DC programming problems is considered where the objective function is the sum of a convex quadratic function, \(p(x)\), and a separable concave function, \(\varphi(x)= \varphi_1(x_1)+\cdots+ \varphi_n(x_n)\). The feasible domain is the intersection of a polytope and a box. The problem is converted into a quadratic convex problem by replacing the functions \(\varphi_j(x_j)\) by linear underestimates \(\psi_j(x_j)\), which depend on the subdomains generated by the branch and bound algorithm. Several bisection techniques are compared in numerical examples.
scientific article; zbMATH DE number 2175490