Abstract
In this article, efficient solutions of multiple objective optimization problems with trade-offs, bounded by prespecified lower and upper bounds, are investigated. It is shown that one of the existing techniques to obtain these solutions does not work correctly. Furthermore, a new approach is given to approximate the set of such solutions. In addition to theoretical discussions, some clarifying examples are given.
ACKNOWLEDGEMENTS
The authors would like to express their gratitude to the anonymous referee for helpful comments on the first version of the article.
Notes
Color versions of one or more of the figures in the article can be found online at www.tandfonline.com/lnfa.