A nonisolated optimal solution for special reverse convex programming problems

  • Authors:
  • Pei-Ping Shen;Yong-Qiang Chen;Yuan Ma

  • Affiliations:
  • College of Mathematics and Information Science, Henan Normal University, Xinxiang, 453007, PR China;College of Mathematics and Information Science, Henan Normal University, Xinxiang, 453007, PR China;College of Mathematics and Information Science, Henan Normal University, Xinxiang, 453007, PR China

  • Venue:
  • Journal of Computational and Applied Mathematics
  • Year:
  • 2009

Quantified Score

Hi-index 7.29

Visualization

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.