The aim of this paper is the development of an algorithm to find the critical points of a linearly constrained multiobjective optimization problem. The proposed algorithm is an interior point method based on suitable directions that play the role of projected gradient-like directions for the vector objective function. The method does not rely on an "a priori" scalarization of the vector objective function and is based on a dynamic system defined by a vector field of descent directions in the feasible region. We prove that the limit points of the solutions of the system satisfy the Karush-Kuhn-Tucker (KKT) first order necessary condition for the linearly constrained multiobjective optimization problem. The algorithm has been tested on some linearly constrained optimization problems and the numerical results obtained show that the algorithm approximates satisfactory the whole (weakly) local optimal Pareto set.

Miglierina, E., Molho, E., Recchioni, M. C., An interior point method for linearly constrained multiobjective optimization based on suitable descent directions, in Recent Developments on Mathematical Programming and Applications, (Pisa, 05-05 June 2009), Aracne editrice, Roma 2009: 89-102 [http://hdl.handle.net/10807/1567]

An interior point method for linearly constrained multiobjective optimization based on suitable descent directions

Miglierina, Enrico;
2009

Abstract

The aim of this paper is the development of an algorithm to find the critical points of a linearly constrained multiobjective optimization problem. The proposed algorithm is an interior point method based on suitable directions that play the role of projected gradient-like directions for the vector objective function. The method does not rely on an "a priori" scalarization of the vector objective function and is based on a dynamic system defined by a vector field of descent directions in the feasible region. We prove that the limit points of the solutions of the system satisfy the Karush-Kuhn-Tucker (KKT) first order necessary condition for the linearly constrained multiobjective optimization problem. The algorithm has been tested on some linearly constrained optimization problems and the numerical results obtained show that the algorithm approximates satisfactory the whole (weakly) local optimal Pareto set.
Inglese
Recent Developments on Mathematical Programming and Applications
Workshop on Recent Developments on Mathematical Programming and Applications
Pisa
5-giu-2009
5-giu-2009
978-88-548-2654-0
Miglierina, E., Molho, E., Recchioni, M. C., An interior point method for linearly constrained multiobjective optimization based on suitable descent directions, in Recent Developments on Mathematical Programming and Applications, (Pisa, 05-05 June 2009), Aracne editrice, Roma 2009: 89-102 [http://hdl.handle.net/10807/1567]
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/10807/1567
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact