Neighbourhood Search for constructing Pareto sets

This paper describes theNeighbourhood Search, an effectivemethod that we suggest for constructing Pareto sets in multiple objective problems with conegenerated orders. TheNeighbourhood Search is then applied to discounted Markov Decision Processes, resulting in original statements about topological properties of Pareto sets. A meaningful example is also presented. Copyright Springer-Verlag 2007

MoreLess

Year of publication:	2007
Authors:	Dorini, G. ; Pierro, F. ; Savic, D. ; Piunovskiy, A.
Published in:	Mathematical Methods of Operations Research. - Springer. - Vol. 65.2007, 2, p. 315-337
Publisher:	Springer
Subject:	Multi-objective optimization \| Cone-generated order \| Convex analysis \| Pareto set \| Markov Decision Process (MDP) \| Dynamic programming \| Linear programming

Online Resource

Check full text access |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Extent:	text/html
Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10010950383