Solution procedures for multi-objective markov decision processes

DOI10.1080/02331939808844372zbMath0905.90178OpenAlexW2049746990MaRDI QIDQ4389873

Kazuhito Togawa, Kazuyoshi Wakuta

Publication date: 9 February 1999

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939808844372

zbMATH Keywords

policy iterationmulti-objective Markov decision processes

Mathematics Subject Classification ID

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

Related Items (3)

A multi-objective approach for PH-graphs with applications to stochastic shortest paths ⋮ Computing multiobjective Markov chains handled by the extraproximal method ⋮ Using the Manhattan distance for computing the multiobjective Markov chains problem

Cites Work

• Unnamed Item
• Unnamed Item
• Markov decision processes with multiple costs
• Linear multiobjective programming
• Vector-valued Markov decision processes and the systems of linear inequalities
• Finite state Markovian decision processes
• VMDP-program for solving optimality problems in vector criterion Markov and semi-Markov decision processes
• New Finite Pivoting Rules for the Simplex Method
• Linear programming in tector criterion markov and semi-Markov decision processes
• A revised simplex method for linear multiple objective programs
• Discrete Dynamic Programming
• On Finding Optimal Policies in Discrete Dynamic Programming with No Discounting

This page was built for publication: Solution procedures for multi-objective markov decision processes