A simple method for approximating a general Pareto surface

Research output: Contribution to journalArticleScientificpeer-review

Researchers

  • Tapani Lehtonen
  • Pertti Pulkkinen

Research units

Abstract

We present a simple iterative procedure for approximating the Pareto surface of a set S and the only assumption is that S is closed and bounded. The algorithm creates a sequence of upper bounds for the Pareto surface and these upper bounds tighten towards the surface as the number of iteration loops increases towards infinity. The approximation method is further developed towards a tool for optimization in general situations and it may also be applied in interactive multiobjective optimization.

Details

Original languageEnglish
Pages (from-to)115-124
Number of pages10
JournalJournal of Multi-Criteria Decision Analysis
Volume17
Issue number3-4
Publication statusPublished - 1 Jan 2010
MoE publication typeA1 Journal article-refereed

    Research areas

  • Approximation of pareto surface, Domination, Multiobjective optimization, Upper bound

ID: 28748544