Neighbourhood search for constructing Pareto sets

DOI10.1007/s00186-006-0117-xzbMath1216.90077OpenAlexW2124239932WikidataQ57920573 ScholiaQ57920573MaRDI QIDQ1006544

J. Martínez

Publication date: 25 March 2009

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00186-006-0117-x

zbMATH Keywords

linear programmingmulti-objective optimizationdynamic programmingconvex analysisPareto setMarkov decision process (MDP)cone-generated order

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Markov decision processes with multiple costs
• Finding all maximal efficient faces in multiobjective linear programming
• Determination of the efficient set in multiobjective linear programming
• Multicriteria optimization
• Constrained Markovian decision processes: The dynamic programming approach
• The scalarization approach to multiobjective Markov control problems: \textit{Why} does it work?
• Nonatomic total rewards Markov decision processes with multiple criteria
• A new class of policies in vector-valued Markov decision processes
• Constrained Discounted Markov Decision Processes and Hamiltonian Cycles
• Controlled random sequences: methods of convex analysis and problems with functional constraints
• Discounted Cost Markov Decision Processes with a Constraint
• Constrained Discounted Dynamic Programming
• Dynamic Programming Equations for Discounted Constrained Stochastic Control

This page was built for publication: Neighbourhood search for constructing Pareto sets