Shao, Lizhen; Ehrgott, Matthias - In: Journal of Global Optimization 58 (2014) 4, pp. 711-728
Multiplicative programming problems are global optimisation problems known to be NP-hard. In this paper we propose an objective space cut and bound algorithm for approximately solving convex multiplicative programming problems. This method is based on an objective space approximation algorithm...