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. (C) 2013 Elsevier Inc. All rights reserved.

[发布日期] 2013-12-15

[关键词] Canonical DC programming problem;Lagrange duality theorem