Shao, Lizhen and Ehrgott, Matthias (2014) An objective space cut and bound algorithm for convex multiplicative programmes. Journal of Global Optimization, 58 (4). pp. 711-728. ISSN 0925-5001
Full text not available from this repository.Abstract
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 for convex multi-objective programming problems. We show that this multi-objective optimisation algorithm can be changed into a cut and bound algorithm to solve convex multiplicative programming problems. We use an illustrative example to demonstrate the working of the algorithm. Computational experiments illustrate the superior performance of our algorithm compared to other methods from the literature.