A nonisolated optimal solution for special reverse convex programming problems

Abstract

a b s t r a c tIn 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.

The two-stage delay distribution method based on compensation mechanism under random environment

“…From model (2) we can see that the objective function is a synthesis effect function. Because it contains the probability of event to occur Pr(n + ξ ≤ mQ), so we can use genetic algorithm with random simulation to solve it (Shen et al, 2009;Lv et al, 2010;Shang and Yu, 2011). And we also can use analytical method to solve it.…”

A range division and contraction approach for nonconvex quadratic program with quadratic constraints

“… 2004 ; Shen 2005 ; Shen and Li 2013 ; Shen and Bai 2013 ; Shen et al. 2009 ) for solving geometric programming can be also used to solve the nonconvex quadratic program with quadratic constraints proposed in this paper. In addition, some recent artificial intelligent optimization algorithms (Zhang et al.…”