Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4641775 | Journal of Computational and Applied Mathematics | 2009 | 11 Pages |
Abstract
In this paper, an efficient algorithm is proposed for globally solving special reverse convex programming problems with more than one reverse convex constraints. The proposed algorithm provides a nonisolated global optimal solution which is also stable under small perturbations of the constraints, and it turns out that such an optimal solution is adequately guaranteed to be feasible and to be close to the actual optimal solution. Convergence of the algorithm is shown and the numerical experiment is given to illustrate the feasibility of the presented algorithm.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Pei-Ping Shen, Yong-Qiang Chen, Yuan Ma,