Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
PAINT: Pareto front interpolation for nonlinear multiobjective optimization
KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory.
University of Jyväskylä, Finland.
Clemson University.
2012 (English)In: Computational optimization and applications, ISSN 0926-6003, E-ISSN 1573-2894, Vol. 52, no 3, 845-867 p.Article in journal (Refereed) Published
Abstract [en]

A method called PAINT is introduced for computationally expensive multiobjective optimization problems. The method interpolates between a given set of Pareto optimal outcomes. The interpolation provided by the PAINT method implies a mixed integer linear surrogate problem for the original problem which can be optimized with any interactive method to make decisions concerning the original problem. When the scalarizations of the interactive method used do not introduce nonlinearity to the problem (which is true e.g., for the synchronous NIMBUS method), the scalarizations of the surrogate problem can be optimized with available mixed integer linear solvers. Thus, the use of the interactive method is fast with the surrogate problem even though the problem is computationally expensive. Numerical examples of applying the PAINT method for interpolation are included.

Place, publisher, year, edition, pages
Springer, 2012. Vol. 52, no 3, 845-867 p.
Keyword [en]
Multiobjective optimization, Interactive decision making, Computationally expensive problems, Approximation
National Category
Mathematics
Identifiers
URN: urn:nbn:se:kth:diva-65275DOI: 10.1007/s10589-011-9441-zISI: 000306836900012OAI: oai:DiVA.org:kth-65275DiVA: diva2:483348
Note

QC 20130214

Available from: 2012-04-23 Created: 2012-01-25 Last updated: 2017-12-08Bibliographically approved

Open Access in DiVA

fulltext(896 kB)1047 downloads
File information
File name FULLTEXT01.pdfFile size 896 kBChecksum SHA-512
cdd14dd500ed78f5a252c296ef36dcfc53bcd2871db403dfa8cb9658b2ed229e5873fa2cf2ceb78259f34af4fec9e5c74018583e1e11f08c509879b3b0688f54
Type fulltextMimetype application/pdf

Other links

Publisher's full textThe final publication is available at www.springerlink.com

Search in DiVA

By author/editor
Miettinen, Kaisa
By organisation
Optimization and Systems Theory
In the same journal
Computational optimization and applications
Mathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 1047 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 72 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf