A subgradient supported ellipsoid method for convex multiobjective optimization problems

M. Muthukani () and P. Paramanathan ()
Additional contact information
M. Muthukani: Amrita Vishwa Vidyapeetham
P. Paramanathan: Amrita Vishwa Vidyapeetham

OPSEARCH, 2025, vol. 62, issue 3, No 8, 1239-1261

Abstract: 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.

Keywords: Multi objective optimization; Scalarization procedure; Subgradient; Ellipsoid method (search for similar items in EconPapers)
Date: 2025
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s12597-024-00849-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:opsear:v:62:y:2025:i:3:d:10.1007_s12597-024-00849-y

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/12597

DOI: 10.1007/s12597-024-00849-y

Access Statistics for this article

OPSEARCH is currently edited by Birendra Mandal

More articles in OPSEARCH from Springer, Operational Research Society of India
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().