| Article ID: | iaor20163750 |
| Volume: | 10 |
| Issue: | 8 |
| Start Page Number: | 1757 |
| End Page Number: | 1762 |
| Publication Date: | Dec 2016 |
| Journal: | Optimization Letters |
| Authors: | Soleimani-damaneh Majid, Zamani Moslem |
| Keywords: | programming: multiple criteria, programming: convex |
In this paper, a popular scalarization problem in multiobjective optimization, introduced by Benson, is considered. In the literature it was proved that, under convexity assumption, the set of properly efficient points is empty when the Benson’s problem is unbounded. In this paper, it is shown that this result is still valid in general case without convexity assumption.