Minimizing a quasi-concave function subject to a reverse convex constraint

Any constraintg(x)0 is called a reverse convex constraint ifg: R ⁿ R ¹ is a continuous convex function. This paper establishes a finite method for finding an optimal solution to a concave program with an additional reverse convex constraint. The method presented is a new approach to global optimization problems since it combines the idea of the branch and bound method with the idea of the cutting plane method.This paper is dedicated to Professor A. Pelczar