IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v88y2024i4d10.1007_s10898-023-01327-3.html
   My bibliography  Save this article

Optimality and error bound for set optimization with application to uncertain multi-objective programming

Author

Listed:
  • Wenyan Han

    (North Minzu University)

  • Guolin Yu

    (North Minzu University)

Abstract

This paper deals with optimality conditions and error bound for a set optimization problem with the set less order relation. We introduce two kinds of vectorization functions by using the classical oriented distance function, and discuss their properties with respect to the set less order relation. By virtue of the image space analysis, necessary and sufficient optimality conditions for the weak s-minimal solution are established. We propose a regular weak separation function, which is utilized to construct a gap function and an error bound for the set optimization problem. Problems of uncertain multi-objective programming, shortest path and medical image registration are examined as applications of the results established in the paper.

Suggested Citation

  • Wenyan Han & Guolin Yu, 2024. "Optimality and error bound for set optimization with application to uncertain multi-objective programming," Journal of Global Optimization, Springer, vol. 88(4), pages 979-998, April.
    • Handle: RePEc:spr:jglopt:v:88:y:2024:i:4:d:10.1007_s10898-023-01327-3
    DOI: 10.1007/s10898-023-01327-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-023-01327-3
    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-023-01327-3?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:88:y:2024:i:4:d:10.1007_s10898-023-01327-3. 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.