IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v91y2025i1d10.1007_s10898-024-01438-5.html
   My bibliography  Save this article

Unboundedness of the images of set-valued mappings having closed graphs: application to vector optimization

Author

Listed:
  • V. T. Hieu

    (Norwegian University of Science and Technology
    Center for Advanced Intelligence Project, RIKEN)

  • E. A. S. Köbis

    (Norwegian University of Science and Technology)

  • M. A. Köbis

    (Norwegian University of Science and Technology)

  • P. H. Schmölling

    (Norwegian University of Science and Technology)

Abstract

In this paper, we propose criteria for unboundedness of the images of set-valued mappings having closed graphs in Euclidean spaces. We focus on mappings whose domains are non-closed or whose values are connected. These criteria allow us to see structural properties of solutions in vector optimization, where solution sets can be considered as the images of solution mappings associated to specific scalarization methods. In particular, we prove that if the domain of a certain solution mapping is non-closed, then the weak Pareto solution set is unbounded. Furthermore, for a quasi-convex problem, we demonstrate two criteria to ensure that if the weak Pareto solution set is disconnected then each connected component is unbounded.

Suggested Citation

  • V. T. Hieu & E. A. S. Köbis & M. A. Köbis & P. H. Schmölling, 2025. "Unboundedness of the images of set-valued mappings having closed graphs: application to vector optimization," Journal of Global Optimization, Springer, vol. 91(1), pages 217-234, January.
    • Handle: RePEc:spr:jglopt:v:91:y:2025:i:1:d:10.1007_s10898-024-01438-5
    DOI: 10.1007/s10898-024-01438-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-024-01438-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10898-024-01438-5?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jglopt:v:91:y:2025:i:1:d:10.1007_s10898-024-01438-5. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.