Lagrange duality in canonical DC programming

We study Lagrange duality theorems for canonical DC programming problems. We show two types Lagrange duality results by using a decomposition method to infinite convex programming problems and by using a previous result by Lemaire (1998)  [6]. Also we observe these constraint qualifications for the duality theorems.