From: Inner approximation algorithm for generalized linear multiplicative programming problems
Dimension | Iterations | CPU time | Error in objective | Error in constraint |
---|---|---|---|---|
n = 5 | 23 | 9.082938 | 0 | 4.4409 × 10−16 |
n = 10 | 20 | 14.92016 | 3.5527 × 10−15 | 2.6645 × 10−15 |
n = 20 | 17 | 36.85216 | 0 | 6.2172 × 10−15 |
n = 30 | 53 | 239.0432 | 3.5527 × 10−15 | 5.3291 × 10−15 |
n = 50 | 25 | 257.7263 | 0.7698 × 10−15 | 1.5395 × 10−14 |
n = 70 | 35 | 740.6696 | 8.8818 × 10−16 | 3.5527 × 10−15 |
n = 80 | 56 | 1583.152 | 1.7764 × 10−15 | 1.7764 × 10−15 |
n = 100 | 69 | 2043.238 | 0 | 3.1086 × 10−15 |