IDEAS home Printed from https://ideas.repec.org/a/spr/opsear/v62y2025i3d10.1007_s12597-024-00849-y.html
   My bibliography  Save this article

A subgradient supported ellipsoid method for convex multiobjective optimization problems

Author

Listed:
  • M. Muthukani

    (Amrita Vishwa Vidyapeetham)

  • P. Paramanathan

    (Amrita Vishwa Vidyapeetham)

Abstract

Multi-objective optimization is a computational technique used to find the best solution for a problem with multiple conflicting objectives. A set of solutions that represents a trade-off between the competing objectives, known as the Pareto front or Pareto set. A common method for solving multi-objective optimization problems is the scalarization method, which converts multi objectives into a single objective. However, the scalarization may not cover the entire pareto front in complex multi-objective optimization problems. In this paper, an ellipsoid algorithm is proposed to overcome the disadvantages of the scalarization method. An ellipsoid algorithm does not combine objectives into single objective. Rather, it directly explore the solution space, aiming to find solutions that are not restricted by the limitations of scalarization. The proposed algorithm mainly targets the multi-objective optimization problems with linear constraints. Also, the convergence rate and the numerical examples justify the effectiveness of the proposed ellipsoid method.

Suggested Citation

  • M. Muthukani & P. Paramanathan, 2025. "A subgradient supported ellipsoid method for convex multiobjective optimization problems," OPSEARCH, Springer;Operational Research Society of India, vol. 62(3), pages 1239-1261, September.
    • Handle: RePEc:spr:opsear:v:62:y:2025:i:3:d:10.1007_s12597-024-00849-y
    DOI: 10.1007/s12597-024-00849-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12597-024-00849-y
    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/s12597-024-00849-y?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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:opsear:v:62:y:2025:i:3:d:10.1007_s12597-024-00849-y. 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.