A simple method for approximating a general Pareto surface

Tapani Lehtonen; Pertti Pulkkinen

doi:10.1002/mcda.453

A simple method for approximating a general Pareto surface

Tapani Lehtonen^*, Pertti Pulkkinen

^*Corresponding author for this work

School Services, BIZ

Research output: Contribution to journal › Article › Scientific › peer-review

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.

Original language	English
Pages (from-to)	115-124
Number of pages	10
Journal	Journal of Multi-Criteria Decision Analysis
Volume	17
Issue number	3-4
DOIs	https://doi.org/10.1002/mcda.453
Publication status	Published - 1 Jan 2010
MoE publication type	A1 Journal article-refereed

Keywords

Approximation of pareto surface
Domination
Multiobjective optimization
Upper bound

Access to Document

10.1002/mcda.453

Link to publication in Scopus

Fingerprint Dive into the research topics of 'A simple method for approximating a general Pareto surface'. Together they form a unique fingerprint.

Cite this

@article{ff097004dcb7437cb3f5ed569620bec5,

title = "A simple method for approximating a general Pareto surface",

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.",

keywords = "Approximation of pareto surface, Domination, Multiobjective optimization, Upper bound",

author = "Tapani Lehtonen and Pertti Pulkkinen",

year = "2010",

month = jan,

day = "1",

doi = "10.1002/mcda.453",

language = "English",

volume = "17",

pages = "115--124",

journal = "Journal of Multi-Criteria Decision Analysis",

issn = "1057-9214",

publisher = "John Wiley and Sons Ltd",

number = "3-4",

}

TY - JOUR

T1 - A simple method for approximating a general Pareto surface

AU - Lehtonen, Tapani

AU - Pulkkinen, Pertti

PY - 2010/1/1

Y1 - 2010/1/1

N2 - 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.

AB - 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.

KW - Approximation of pareto surface

KW - Domination

KW - Multiobjective optimization

KW - Upper bound

UR - http://www.scopus.com/inward/record.url?scp=85040409677&partnerID=8YFLogxK

U2 - 10.1002/mcda.453

DO - 10.1002/mcda.453

M3 - Article

AN - SCOPUS:85040409677

VL - 17

SP - 115

EP - 124

JO - Journal of Multi-Criteria Decision Analysis

JF - Journal of Multi-Criteria Decision Analysis

SN - 1057-9214

IS - 3-4

ER -