Premium
On convex multiobjective programs with application to portfolio optimization
Author(s) -
Jayasekara Pubudu L.W.,
Adelgren Nathan,
Wiecek Margaret M.
Publication year - 2019
Publication title -
journal of multi‐criteria decision analysis
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.462
H-Index - 47
eISSN - 1099-1360
pISSN - 1057-9214
DOI - 10.1002/mcda.1690
Subject(s) - mathematical optimization , class (philosophy) , computer science , quadratic programming , convex optimization , multi objective optimization , regular polygon , quadratic equation , portfolio , perspective (graphical) , optimization problem , convex analysis , parametric statistics , mathematics , artificial intelligence , statistics , geometry , financial economics , economics
Abstract Focusing on (strictly) convex multiobjective programs (MOPs), we review some well‐established scalarizations in multiobjective programming from the perspective of parametric optimization and propose a modified hybrid scalarization suitable for a class of specially structured convex MOPs. Because multiobjective quadratic programs are a prominent class of convex MOPs due to their broad applicability, we review the state‐of‐the‐art algorithms for computing their efficient solutions. These two lines of investigation are merged to solve multiobjective portfolio optimization problems with three or more quadratic objective functions, a class of problems that has not been solved before. Computational examples are provided.