Pages that link to "Item:Q2228731"

The following pages link to Solving the Pareto front for multiobjective Markov chains using the minimum Euclidean distance gradient-based optimization method (Q2228731):

Displaying 8 items.

• Necessary and sufficient Karush-Kuhn-Tucker conditions for multiobjective Markov chains optimality (Q313188) (← links)
• Constructing the Pareto front for multi-objective Markov chains handling a strong Pareto policy approach (Q1655397) (← links)
• Computing multiobjective Markov chains handled by the extraproximal method (Q1730553) (← links)
• Finding the strong Nash equilibrium: computation, existence and characterization for Markov games (Q2198544) (← links)
• A Tikhonov regularized penalty function approach for solving polylinear programming problems (Q2406305) (← links)
• On Lyapunov Game Theory Equilibrium: Static and Dynamic Approaches (Q4567819) (← links)
• Using the Manhattan distance for computing the multiobjective Markov chains problem (Q5028582) (← links)
• Dr. Alexander Semionovich Poznyak Gorbatch: Biography (Q5377579) (← links)