objective space cut and bound algorithm for approximately solving convex multiplicative programming problems. This method is …-objective optimisation algorithm can be changed into a cut and bound algorithm to solve convex multiplicative programming problems. We use an …