IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v346y2025i2d10.1007_s10479-022-05104-5.html
   My bibliography  Save this article

Adjustable robust multiobjective linear optimization: Pareto optimal solutions via conic programming

Author

Listed:
  • T. D. Chuong

    (Saigon University
    RMIT University)

  • V. Jeyakumar

    (University of New South Wales)

Abstract

In this paper we study two-stage affinely adjustable robust multi-objective optimization problems. We show how (weak) Pareto optimal solutions of these robust multi-objective problems can be found by solving conic linear programming problems. We do this by first deriving numerically verifiable conditions that characterize (weak) Pareto optimal solutions of affinely adjustable robust multi-objective programs under a spectrahedron uncertainty set. The uncertainty set covers most of the commonly used uncertainty sets of robust optimization. We then reformulate the weighted-sum optimization problems of the multi-objective problems, derived with the aid of the optimality conditions, as equivalent conic linear programming problems, such as semidefinite programs or second-order cone programs, to find the (weak) Pareto optimal solutions. We illustrate by an example how our results can be used to find a second-stage (weak) Pareto optimal solution by solving a semidefinite program using a commonly available software.

Suggested Citation

  • T. D. Chuong & V. Jeyakumar, 2025. "Adjustable robust multiobjective linear optimization: Pareto optimal solutions via conic programming," Annals of Operations Research, Springer, vol. 346(2), pages 895-916, March.
    • Handle: RePEc:spr:annopr:v:346:y:2025:i:2:d:10.1007_s10479-022-05104-5
    DOI: 10.1007/s10479-022-05104-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-022-05104-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/s10479-022-05104-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:annopr:v:346:y:2025:i:2:d:10.1007_s10479-022-05104-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.