D.C. Programming

In Chapter X, we continue the discussion of d.c. programming problems. First, a duality theory is developed between the objective and the constraints of a very general class of optimization problems. This theory allows one to derive several outer approximation methods for solving canonical d.c. problems and even certain d.c. problems that involve functions whose d.c. representations are not known. Then we present branch and bound methods for the general d.c. program and a combination of outer approximations and branch and bound. Finally, the design centering problem and biconvex programming are discussed in some detail.