Table 2 Results of the numerical comparison of Examples 5–9
From: Inner approximation algorithm for generalized linear multiplicative programming problems
Example | Methods | Optimal value | Optimal solution | CPU time |
|---|---|---|---|---|
[9] | 11.9541 | (11.9604,0.8105,442.344) | 0.416 | |
Ours | 11.3497 | (11.9604,0.681143,436.918047) | 0.13252 | |
[9] | −5.7416 | (8.1244,0.6027,0.5660,5.6352) | 42.3259 | |
Ours | −9.2952 | (9.6867,0.5585,0.1000,5.3252) | 0.8273 | |
[27] | 10,127.13 | (78,32.999,29.995,45,36.7753) | 1 | |
Ours | 10,122.49325 | (78,33,29.9957,45,36.775327) | 0.331298 | |
[26] | −15.0 | (2,1) | 120.580 | |
Ours | −15.0 | (2,1) | 0.3556 | |
[9] | 1.177081 | (1.77091,2.17715) | 0.2260 | |
[27] | 1.1771243 | (1.17712,2.17712) | 0.26069 | |
Ours | 1.177124 | (1.177124,2.177124) | 0.18726 |