Research Article
Generating Efficient Outcome Points for Convex Multiobjective Programming Problems and Its Application to Convex Multiplicative Programming
Table 2
Computational results on the problem of Type 2.
| Problem no. | | | | Average number of iterations | Average CPU time (sec) |
| 1 | 3 | 20 | 20 | 14 | 5.18 | 2 | 3 | 20 | 30 | 26.9 | 14.64 | 3 | 3 | 30 | 50 | 40 | 51.35 | 4 | 3 | 40 | 60 | 42.6 | 77.38 | 5 | 3 | 60 | 100 | 59.5 | 316.79 | 6 | 4 | 20 | 20 | 34.8 | 7.57 | 7 | 4 | 20 | 30 | 89.8 | 35.27 | 8 | 4 | 30 | 50 | 80.7 | 86.83 | 9 | 4 | 40 | 60 | 78.4 | 112.23 | 10 | 4 | 60 | 100 | 85.5 | 372.59 |
|
|