Approximation method for computationally expensive nonconvex multiobjective optimization problems

DSpace/Manakin Repository

Show simple item record

dc.contributor.author Haanpää, Tomi
dc.date.accessioned 2012-12-03T08:28:51Z
dc.date.available 2012-12-03T08:28:51Z
dc.date.issued 2012
dc.identifier.isbn 978-951-39-4968-6
dc.identifier.uri http://hdl.handle.net/123456789/40501
dc.identifier.uri http://urn.fi/URN:ISBN:978-951-39-4968-6 en
dc.format.extent 1 verkkojulkaisu (180 s.)
dc.language.iso eng
dc.publisher University of Jyväskylä
dc.relation.ispartofseries Jyväskylä studies in computing;1456-5390 ;157.
dc.subject.other monitavoiteoptimointi
dc.subject.other Pareto-optimointi
dc.subject.other Pareto-tehokkuus
dc.subject.other laskennallinen vaativuus
dc.subject.other multiobjective optimization
dc.subject.other computational cost
dc.subject.other computational efficiency
dc.subject.other Pareto front approximation
dc.subject.other surrogate function
dc.subject.other interactive decision making
dc.subject.other decision maker
dc.subject.other psychological convergence
dc.subject.other Pareto dominancy
dc.subject.other Pareto optimality
dc.title Approximation method for computationally expensive nonconvex multiobjective optimization problems
dc.type Diss. fi
dc.identifier.urn URN:ISBN:978-951-39-4968-6
dc.subject.ysa päätöksenteko
dc.subject.ysa optimointi
dc.subject.ysa menetelmät
dc.subject.ysa laskennalliset menetelmät
dc.subject.ysa approksimointi
dc.subject.kota 113
dc.type.dcmitype Text en
dc.type.ontasot Väitöskirja fi
dc.type.ontasot Doctoral dissertation en
dc.contributor.tiedekunta Informaatioteknologian tiedekunta fi
dc.contributor.tiedekunta Faculty of Information Technology en
dc.contributor.yliopisto University of Jyväskylä en
dc.contributor.yliopisto Jyväskylän yliopisto fi

This item appears in the following Collection(s)

Show simple item record