Approximation of the Whole Pareto-Optimal Set for the Vector Optimization Problem

Tools

Illes, Tibor and Lovics, Gábor (2013) Approximation of the Whole Pareto-Optimal Set for the Vector Optimization Problem. ELTE/BME. (http://www.optimization-online.org/DB_FILE/2013/04...)

[thumbnail of Illes-Lovics-ORR-2013-Approximation-of-the-Whole-Pareto-Optimal-Set-for-the-Vector]
Preview
 Text. Filename: Illes_Lovics_ORR_2013_Approximation_of_the_Whole_Pareto_Optimal_Set_for_the_Vector.pdf
Final Published Version
Download (641kB)| Preview

Abstract

In multi objective optimization problems several objective functions have to be minimized simultaneously. In this work, we present a new computational method for the numerical solution of the linearly constrained, convex multi objective optimization problem. We propose some technique to find joint decreasing direction for unconstrained and linearly constrained case as well. Based on these results we introduce a method using subdivision technique to approximate the whole Pareto-optimal set of the linearly constrained, convex multi objective optimization problem. Finally, we illustrate computations of our algorithm by solving the Markowitz-model on real data.

ORCID iDs

Illes, Tibor ORCID logoORCID: https://orcid.org/0000-0002-5396-3148 and Lovics, Gábor;
CORE (COnnecting REpositories)