Solving a class of multiplicative programming problems via c-programming

In this note we show that many classes of global optimization problems can be treated most satisfactorily by classical optimization theory and conventional algorithms. We focus on the class of problems involving the minimization of the product of several convex functions on a convex set which was studied recently by Kunoet al. 3]. It is shown that these problems are typical composite concave programming problems and thus can be handled elegantly by c-programming 4]–8] and its techniques.