Constructing the Pareto front for multi-objective Markov chains handling a strong Pareto policy approach
From MaRDI portal
(Redirected from Publication:1655397)
Recommendations
- Computing multiobjective Markov chains handled by the extraproximal method
- Necessary and sufficient Karush-Kuhn-Tucker conditions for multiobjective Markov chains optimality
- The scalarization approach to multiobjective Markov control problems: \textit{Why} does it work?
- Using the Manhattan distance for computing the multiobjective Markov chains problem
- Multi-objective infinite horizon optimal control problems: characterization of the Pareto fronts and Pareto solutions
Cites work
- Title not available (Why is no real title available?)
- scientific article; zbMATH DE number 3809326 (Why is no real title available?)
- scientific article; zbMATH DE number 3926624 (Why is no real title available?)
- scientific article; zbMATH DE number 3551792 (Why is no real title available?)
- scientific article; zbMATH DE number 1975075 (Why is no real title available?)
- scientific article; zbMATH DE number 1461223 (Why is no real title available?)
- scientific article; zbMATH DE number 803211 (Why is no real title available?)
- scientific article; zbMATH DE number 3310599 (Why is no real title available?)
- A method for generating a well-distributed Pareto set in nonlinear multiobjective optimization
- A new scalarization and numerical method for constructing the weak Pareto front of multi-objective optimization problems
- A new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets
- Adaptive Scalarization Methods in Multiobjective Optimization
- An Adaptive Scalarization Method in Multiobjective Optimization
- Approximation methods in multiobjective programming
- Constructing a Pareto front approximation for decision making
- Covering Pareto sets by multilevel subdivision techniques
- Equispaced Pareto front construction for constrained bi-objective optimization
- Fast computation of equispaced Pareto manifolds and Pareto fronts for multiobjective optimization problems
- Generalized homotopy approach to multiobjective optimization.
- Generating well-distributed sets of Pareto points for engineering design using physical programming
- Global search perspectives for multiobjective optimization
- Multi-Objective Control-Structure Optimization via Homotopy Methods
- Multi-objective optimization using evolutionary algorithms
- Multicriteria Optimization
- Nonlinear multiobjective optimization
- Nonlinear multiobjective optimization. A generalized homotopy approach
- Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
- On continuation methods for non-linear bi-objective optimization: towards a certified interval-based approach
- PAINT: Pareto front interpolation for nonlinear multiobjective optimization
- Solving the Pareto front for multiobjective Markov chains using the minimum Euclidean distance gradient-based optimization method
- Stochastic method for the solution of unconstrained vector optimization problems
- The normalized normal constraint method for generating the Pareto frontier
- Tracing the Pareto frontier in bi-objective optimization problems by ODE techniques
Cited in
(5)- Computing multiobjective Markov chains handled by the extraproximal method
- Finding the strong Nash equilibrium: computation, existence and characterization for Markov games
- Using the Manhattan distance for computing the multiobjective Markov chains problem
- Dr. Alexander Semionovich Poznyak Gorbatch: biography
- The scalarization approach to multiobjective Markov control problems: \textit{Why} does it work?
This page was built for publication: Constructing the Pareto front for multi-objective Markov chains handling a strong Pareto policy approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1655397)
