Skip to main content

Advertisement

Springer Nature Link
Log in

Connectedness of super efficient sets in vector optimization of set-valued maps

  • Published:
Mathematical Methods of Operations Research Aims and scope Submit manuscript

Abstract.

This paper deals with the super efficient sets in vector optimization of set-valued maps. It is proved that these sets are connected under an assumption of cone-convexlikeness and upper semicontinuity.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Author information

Authors and Affiliations

  1. Institute of Systems Science, Chinese Academy of Sciences, Beijing 100080, China (e-mail: zfli@iss02.iss.ac.cn; sywang@iss02.iss.ac.cn), , , , , , CN

    Zhong-Fei Li & Shou-Yang Wang

Authors
  1. Zhong-Fei Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shou-Yang Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Revised version received November 1997

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, ZF., Wang, SY. Connectedness of super efficient sets in vector optimization of set-valued maps. Mathematical Methods of OR 48, 207–217 (1998). https://doi.org/10.1007/PL00020915

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00020915