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

Using dual relaxations in multiobjective mixed-integer convex quadratic programming

Author

Listed:
  • Marianna Santis

    (Università degli Studi di Firenze)

  • Gabriele Eichfelder

    (Technische Universität Ilmenau)

  • Daniele Patria

    (Sapienza Università di Roma)

  • Leo Warnow

    (Technische Universität Ilmenau)

Abstract

We present a branch-and-bound method for multiobjective mixed-integer convex quadratic programs that computes a superset of efficient integer assignments and a coverage of the nondominated set. The method relies on outer approximations of the upper image set of continuous relaxations. These outer approximations are obtained addressing the dual formulations of specific subproblems where the values of certain integer variables are fixed. The devised pruning conditions and a tailored preprocessing phase allow a fast enumeration of the nodes. Despite we do not require any boundedness of the feasible set, we are able to prove that the method stops after having explored a finite number of nodes. Numerical experiments on a broad set of instances with two, three, and four objectives are presented.

Suggested Citation

  • Marianna Santis & Gabriele Eichfelder & Daniele Patria & Leo Warnow, 2025. "Using dual relaxations in multiobjective mixed-integer convex quadratic programming," Journal of Global Optimization, Springer, vol. 92(1), pages 159-186, May.
    • Handle: RePEc:spr:jglopt:v:92:y:2025:i:1:d:10.1007_s10898-024-01440-x
    DOI: 10.1007/s10898-024-01440-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-024-01440-x
    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-01440-x?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:92:y:2025:i:1:d:10.1007_s10898-024-01440-x. 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.