An efficient outer space branch-and-bound algorithm for globally minimizing linear multiplicative problems
We propose an efficient outer space branch-and-bound algorithm for minimizing linear multiplicative problems (LMP). First, by introducing auxiliary variables, LMP is transformed into an equivalent problem (ELMP), where the number of auxiliary variables is equal to the number of linear functions. Sub...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AIMS Press
2023-09-01
|
| Series: | AIMS Mathematics |
| Subjects: | |
| Online Access: | https://www.aimspress.com/article/doi/10.3934/math.20231327?viewType=HTML |