IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v202y2024i3d10.1007_s10957-024-02481-8.html
   My bibliography  Save this article

The Weighted p-Norm Weight Set Decomposition for Multiobjective Discrete Optimization Problems

Author

Listed:
  • Stephan Helfrich

    (RPTU Kaiserslautern-Landau)

  • Kathrin Prinz

    (RPTU Kaiserslautern-Landau)

  • Stefan Ruzika

    (RPTU Kaiserslautern-Landau)

Abstract

Many solution algorithms for multiobjective optimization problems are based on scalarization methods that transform the multiobjective problem into a scalar-valued optimization problem. In this article, we study the theory of weighted $$p$$ p -norm scalarizations. These methods minimize the distance induced by a weighted $$p$$ p -norm between the image of a feasible solution and a given reference point. We provide a comprehensive theory of the set of eligible weights and, in particular, analyze the topological structure of the normalized weight set. This set is composed of connected subsets, called weight set components which are in a one-to-one relation with the set of optimal images of the corresponding weighted $$p$$ p -norm scalarization. Our work generalizes and complements existing results for the weighted sum and the weighted Tchebycheff scalarization and provides new insights into the structure of the set of all Pareto optimal solutions.

Suggested Citation

  • Stephan Helfrich & Kathrin Prinz & Stefan Ruzika, 2024. "The Weighted p-Norm Weight Set Decomposition for Multiobjective Discrete Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 202(3), pages 1187-1216, September.
    • Handle: RePEc:spr:joptap:v:202:y:2024:i:3:d:10.1007_s10957-024-02481-8
    DOI: 10.1007/s10957-024-02481-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-024-02481-8
    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/s10957-024-02481-8?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:joptap:v:202:y:2024:i:3:d:10.1007_s10957-024-02481-8. 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.