Research Article
A New Global Optimization Algorithm for Solving a Class of Nonconvex Programming Problems
Table 2
Computational results of Example
6.
| | Example | (, ) | Iter. | Time |
| |
1 | (10, 10) | 41.8 | 33.7 | | 2 | (10, 20) | 43.2 | 35.3 | | 3 | (20, 20) | 69.1 | 46.5 | | 4 | (20, 30) | 75.6 | 49.9 | | 5 | (30, 10) | 88.7 | 57.0 | | 6 | (30, 20) | 91.8 | 61.7 | | 7 | (40, 10) | 118.2 | 78.4 | | 8 | (40, 20) | 125.0 | 82.5 | | 9 | (50, 10) | 138.6 | 88.9 | | 10 | (50, 20) | 146.7 | 92.0 |
|
|
