Multiplicative programming problems are difficult global optimization problems known to be NP-hard. In this paper we propose a method for approximately solving convex multiplicative programming problems. This work is based on our previous work "An approximation algorithm for convex multiobjective programming problems". We show, by slightly changing the algorithm, that our method can be used to solve convex multiplicative programming problems. We provide an example that shows that our method has computational advantage compared with Benson's outcome space branch and bound outer approximation algorithm.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.