A nonisolated optimal solution for special reverse convex programming problems

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, a...

Full description

Saved in:
Bibliographic Details
Published in:Journal of computational and applied mathematics Vol. 224; no. 1; pp. 219 - 229
Main Authors: Shen, Pei-Ping, Chen, Yong-Qiang, Ma, Yuan
Format: Journal Article
Language:English
Published: Kidlington Elsevier B.V 01.02.2009
Elsevier
Subjects:
ISSN:0377-0427, 1879-1778
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0377-0427
1879-1778
DOI:10.1016/j.cam.2008.04.032