This paper presents an outer space branch-reduction-bound algorithm for globally solving
generalized affine multiplicative problems (GAMP). For finding the globally optimal solution …

Linear multiplicative programming (LMP) problems have many applications, although their
solving can be difficult. To solve LMPs, we propose a convex approximation approach with a …

In this paper, a new relaxation bounding method is proposed for a class of linear
multiplicative programs. Although the 2 p− 1 variable is introduced in the construction of …

In this paper, we investigate a class of linear fractional-multiplicative programs with
exponents, which have important applications in finance and economy. By introducing p …

Generalized linear multiplicative programming problems are difficult problems known to be
N P-hard, and they frequently arise in various areas such as engineering, economics …

In this paper, a new outer space rectangle branch and bound algorithm is proposed for
globally solving generalized affine multiplicative programming problem. By applying the …

This paper interprets an image space accelerating branch and bound algorithm for globally
solving a class of multiplicative programming problems (MP). In this algorithm, in order to …

In this study, we investigate a class of linear multiplicative programs with positive exponents.
By introducing p additional variables, the original problem is reformulated into an equivalent …

We consider a class of generalized linear multiplicative problems (GLMP), which have a
wide range of applications and are known to be NP-hard. In this paper, we first transform it …

We propose an efficient outer space branch-and-bound algorithm for minimizing linear
multiplicative problems (LMP). First, by introducing auxiliary variables, LMP is transformed …