A Branch-and-Reduce Approach for Solving Generalized Linear Multiplicative Programming

الملخص EN

We consider a branch-and-reduce approach for solving generalized linear multiplicative programming.

First, a new lower approximate linearization method is proposed; then, by using this linearization method, the initial nonconvex problem is reduced to a sequence of linear programming problems.

Some techniques at improving the overall performance of this algorithm are presented.

The proposed algorithm is proved to be convergent, and some experiments are provided to show the feasibility and efficiency of this algorithm.