| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4615925 | Journal of Mathematical Analysis and Applications | 2014 | 10 Pages |
Abstract
We show a Lagrange-type duality theorem for a DC programming problem, which is a generalization of previous results by J.-E. Martínez-Legaz, M. Volle [5] and Y. Fujiwara, D. Kuroiwa [1] when all constraint functions are real-valued. To the purpose, we decompose the DC programming problem into certain infinite convex programming problems.
Related Topics
Physical Sciences and Engineering
Mathematics
Analysis
Authors
Ryohei Harada, Daishi Kuroiwa,