Using the Manhattan distance for computing the multiobjective Markov chains problem

DOI10.1080/00207160.2017.1381690zbMath1499.90193OpenAlexW2755461804MaRDI QIDQ5028582

Julio B. Clempner, Alexander S. Poznyak

Publication date: 10 February 2022

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

multi-objective optimizationMarkov chainsPareto optimalityPareto frontstrong Pareto policies

Mathematics Subject Classification ID

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

Related Items (1)

Dr. Alexander Semionovich Poznyak Gorbatch: Biography

Uses Software

• SPEA2

Cites Work

• Necessary and sufficient Karush-Kuhn-Tucker conditions for multiobjective Markov chains optimality
• Computing the Stackelberg/Nash equilibria using the extraproximal method: convergence analysis and implementation details for Markov chains games
• Multiobjective optimization. Interactive and evolutionary approaches
• Fast computation of equispaced Pareto manifolds and Pareto fronts for multiobjective optimization problems
• The closest solution to the shadow minimum of a cooperative dynamic game
• Nonlinear multiobjective optimization
• Covering Pareto sets by multilevel subdivision techniques
• Solving the Pareto front for multiobjective Markov chains using the minimum Euclidean distance gradient-based optimization method
• Equispaced Pareto front construction for constrained bi-objective optimization
• Multi-objective Reinforcement Learning through Continuous Pareto Manifold Approximation
• A Survey of Multi-Objective Sequential Decision-Making
• Multi-Objective Control-Structure Optimization via Homotopy Methods
• Multiobjective Markov decisions in urban modelling
• Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
• Solution procedures for multi-objective markov decision processes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Using the Manhattan distance for computing the multiobjective Markov chains problem