Skip to main content
Log in

On Benson’s scalarization in multiobjective optimization

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Benson, H.: Existence of efficient solutions for vector maximization problems. J. Optim. Theory Appl. 26(4), 569–580 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  2. Benson, H.: An improved definition of proper efficiency for vector maximization with respect to cones. J. Optim. Theory Appl. 71, 232–241 (1979)

    MathSciNet  MATH  Google Scholar 

  3. Borwein, J.M.: Proper efficient points for maximization with respect to cones. SIAM J. Control Optim. 15, 57–63 (1977)

    Article  MATH  Google Scholar 

  4. Ecker, J.G., Kouada, I.A.: Finding efficient points for linear multiple objective programs. Math. Programm. 8, 375–377 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  5. Ehrgott, M.: Multicriteria Optim. Springer, Berlin (2005)

    MATH  Google Scholar 

  6. Geoffrion, A.: Proper efficiency and the theory of vector maximization. J. Math. Anal. Appl. 22, 618–630 (1968)

    Article  MathSciNet  MATH  Google Scholar 

  7. Giannessi, F., Matroeni, G., Pellegrini, L.: On the theory of vector optimization and variational inequalities; image space analysis and separation. In: Giannessi, F. (ed.) Vector Variational Inequalities and Vector Equilibria. Mathematical Theories, vol. 38, pp. 141–215, Kluwer, Dordrecht (2000)

  8. Guddat, J., Guerra Vasquez, F., Tammer, K., Wendler, K.: Multiobjective and Stochastic Optimization Based on Parametric Optimization, Akademie, Berlin (1985)

  9. Henig, M.: Proper efficiency with respect to cones. J. Optim. Theory Appl. 36(3), 387–407 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  10. Kuhn, H., Tucker, A.: Nonlinear programming. In: Neyman, J. (ed.) Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability, pp. 481–492. University of California Press, Berkeley (1951)

    Google Scholar 

  11. Sawaragi, Y., Nakayama, H., Tanino, T.: Theory of Multiobjective Optimization. Academic Press, Orlando (1985)

    MATH  Google Scholar 

  12. Soleimani-damaneh, M.: Nonsmooth optimization using Mordukhovichs subdifferential. SIAM J. Control Optim. 48, 3403–3432 (2010)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

The authors would like to express their gratitude to anonymous referee and handling editor for their helpful comments on the first version of this paper. This research was in part supported by a Grant from IPM (No. 94260124).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Majid Soleimani-damaneh.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Soleimani-damaneh, M., Zamani, M. On Benson’s scalarization in multiobjective optimization. Optim Lett 10, 1757–1762 (2016). https://doi.org/10.1007/s11590-016-0999-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-016-0999-3

Keywords

Navigation