Research Article
Generating Efficient Outcome Points for Convex Multiobjective Programming Problems and Its Application to Convex Multiplicative Programming
Table 1
Computational results on the problem of Type 1.
| Problem no. | | | | Average number of iterations | Average CPU time (sec) |
| 1 | 3 | 10 | 10 | 11 | 0.83 | 2 | 3 | 20 | 20 | 9.9 | 2.08 | 3 | 3 | 30 | 50 | 19.2 | 19.4 | 4 | 3 | 40 | 60 | 17.5 | 24.42 | 5 | 3 | 60 | 100 | 26.2 | 109.6 | 6 | 4 | 20 | 20 | 23.1 | 4.3 | 7 | 4 | 20 | 30 | 14.1 | 4.87 | 8 | 4 | 30 | 50 | 26.2 | 20 | 9 | 4 | 40 | 60 | 59.6 | 61.64 | 10 | 4 | 60 | 100 | 36.6 | 142.32 |
|
|