Article ID: | iaor2002422 |
Country: | United States |
Volume: | 107 |
Issue: | 2 |
Start Page Number: | 355 |
End Page Number: | 389 |
Publication Date: | Nov 2000 |
Journal: | Journal of Optimization Theory and Applications |
Authors: | Inuiguchi M., Yamada S., Tanino T. |
In this paper, we consider a reverse convex programming problem constrained by a convex set and a reverse convex set, which is defined by the complement of the interior of a compact convex set X. We propose an inner approximation method to solve the problem in the case where X is not necessarily a polytope. The algorithm utilizes an inner approximation of X by a sequence of polytopes to generate relaxed problems. It is shown that every accumulation point of the sequence of optimal solutions of the relaxed problems is an optimal solution of the original problem.