Skip to main content
SpringerLink
Log in

Nearly Subconvexlike Set-Valued Maps and Vector Optimization Problems

  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

This paper gives several characterizations of nearly subconvexlike set-valued maps (see Ref. 1) and shows that a weakly efficient solution and a Benson properly efficient solution of a vector optimization problem with nearly-subconvexlike objectives and constraints can be expressed in terms of saddle points defined in a suitable sense.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Yang, X.M., Li, D., and Wang, S.Y., Near-Subconvexlikeness in Vector Optimization with Set-Valued Functions, Journal of Optimization Theory and Applications, Vol. 110, pp. 413-427, 2001.

    Google Scholar 

  2. Fan, K., Minimax Theorems, Proceedings of the National Academy of Sciences of the USA, Vol. 39, pp. 42-47, 1953.

    Google Scholar 

  3. Jeyakumar, V., Convexlike Alternative Theorems and Mathematical Programming, Optimization, Vol. 16, pp. 643-652, 1985.

    Google Scholar 

  4. Paeck, S., Convexlike and Concavelike Conditions in Alternative, Minimax, and Minimization Theorems, Journal of Optimization Theory and Applications, Vol. 14, p. 317-332, 1992.

    Google Scholar 

  5. Yang, X.M., Alternative Theorems and Optimality Conditions with Weakened Convexity, Opsearch, Vol. 29. pp. 125-135, 1992.

    Google Scholar 

  6. Chen, G. Y., and Rong, W. D., Characterization of the Benson Proper Efficiency for Nonconvex Vector Optimization, Journal of Optimization Theory and Applications, Vol. 98, pp. 365-384, 1998.

    Google Scholar 

  7. Li, Z. F., and Wang, S.Y., Lagrange Multipliers and Saddle Points in Multiobjective Programming, Journal of Optimization Theory and Applications, Vol. 83, pp. 63-81, 1994.

    Google Scholar 

  8. Li, Z. F., Benson Proper Efficiency in the Vector Optimization of Set-Valued Maps, Journal of Optimization Theory and Applications, Vol. 98, pp. 623-649, 1998.

    Google Scholar 

  9. Li, Z., A Theorem of the Alternative and Its Applications to the Optimization of Set-Valued Maps, Journal of Optimization Theory and Applications, Vol. 100, pp. 365-375, 1999.

    Google Scholar 

  10. Yang, X. M., Yang, X. Q., and Chen, G.Y., Theorems of the Alternative and Optimization with Set-Valued Maps, Journal of Optimization Theory and Applications, Vol. 107, pp. 627-640, 2000.

    Google Scholar 

  11. Brecker, W. W., and Kassay, G., A Systematization of Convexity Concepts for Sets and Functions, Journal of Convex Analysis, Vol. 4, pp. 109-127, 1997.

    Google Scholar 

  12. Song, W., Duality in Set-Valued Optimization, Dissertations Mathematicae, Vol. 375, pp. 1-67, 1998.

    Google Scholar 

  13. Dauer, J. P., and Saleh, O.A., A Characterization of Proper Minimal Points as Solutions of Sublinear Optimization Problems, Journal of Mathematical Analysis and Applications, Vol. 178, pp. 227-246, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, Hanoi, Vietnam

    P. H. Sach (Professor)

Authors
  1. P. H. Sach
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sach, P.H. Nearly Subconvexlike Set-Valued Maps and Vector Optimization Problems. Journal of Optimization Theory and Applications 119, 335–356 (2003). https://doi.org/10.1023/B:JOTA.0000005449.20614.41

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:JOTA.0000005449.20614.41

Search

Navigation