Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver

Andreas Löhne, Andrea Wagner

A class of non-convex optimization problems with DC objective function is studied, where DC stands for being representable as the difference $f=g-h$ of two convex functions $g$ and…