Global Optimization for Solving Linear Multiplicative Programming Based on a New Linearization Method

Abstract EN

This paper presents a new global optimization algorithm for solving a class of linear multiplicative programming (LMP) problem.

First, a new linear relaxation technique is proposed.

Then, to improve the convergence speed of our algorithm, two pruning techniques are presented.

Finally, a branch and bound algorithm is developed for solving the LMP problem.

The convergence of this algorithm is proved, and some experiments are reported to illustrate the feasibility and efficiency of this algorithm.