Random number generators: good ones are hard to find
Communications of the ACM
Communications of the ACM - Special issue on simulation
Determination of the efficient set in multiobjective linear programming
Journal of Optimization Theory and Applications
Computational Optimization and Applications - Special issue dedicated to George Dantzig
Hi-index | 0.00 |
The computational difficulty of obtaining the efficient setin multi-objective programming, specially in nonlinear problems,suggest the need of considering an approximation approach to thisproblem. In this paper, we provide the computational results of therelationships between an approximation to the efficient set and thefeasible and efficient sets. Random problem generation is consideredfor different sizes of the feasible set and we study the implicationswith respect to the number of objective functions and various kindsof objective functions. Computational experience with thisapproximation suggests that we obtain a substantial improvement whenit increases the number of objective functions.