Algorithms for solving discrete optimal control problems with infinite time horizon and determining minimal mean cost cycles in a directed graph as decision support tool

DOI10.1007/S10100-009-0090-6zbMATH Open1204.90108OpenAlexW2074425623MaRDI QIDQ623763FDOQ623763

Authors: Stefan Pickl, Dmitrii Lozovanu 

Publication date: 8 February 2011

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10100-009-0090-6

Recommendations

• Multilayered network games: algorithms for solving discrete optimal control problems with infinite time horizon via minimal mean cost cycles and a game-theoretical approach
• Algorithms for solving discrete optimal control problems with varying time of states' transactions of dynamical systems
• Algorithms for solving discrete control problems on networks
• Algorithms for solving stochastic discrete optimal control problems on networks
• Algorithms for solving stochastic discrete optimal control problems on networks

zbMATH Keywords

time-discrete systemdiscrete control with infinite time horizonenvironmental decision problemminimal mean cost cycle in a digraphstationary control

Mathematics Subject Classification ID

Linear programming (90C05) Fractional programming (90C32) Programming involving graphs or networks (90C35)

Cites Work

• Title not available (Why is that?)
• A characterization of the minimum cycle mean in a digraph
• Optimization and Multiobjective Control of Time-Discrete Systems
• An approach for an algorithmic solution of discrete optimal control problems and their game-theoretical extension
• ON A NEW APPROACH TO THE NUMERICAL SOLUTION OF A CLASS OF PARTIAL DIFFERENTIAL INTEGRAL EQUATIONS OF TRANSPORT THEORY
• Algorithms for finding the minimum cycle mean in the weighted directed graph
• Nash equilibria for multiobjective control of time-discrete systems and polynomial-time algorithms for \(k\)-partite networks
• Title not available (Why is that?)
• Functional equations in the theory of dynamic programming. XI: Limit theorems
• Algorithms and the calculation of Nash equilibria for multi-objective control of time-discrete systems and polynomial-time algorithms for dynamic \(c\)-games on networks

Cited In (3)

• Multilayered network games: algorithms for solving discrete optimal control problems with infinite time horizon via minimal mean cost cycles and a game-theoretical approach
• Algorithms for solving discrete optimal control problems with varying time of states' transactions of dynamical systems
• On qualitatively consistent, transitive and contradictory judgment matrices emerging from multiattribute decision procedures

This page was built for publication: Algorithms for solving discrete optimal control problems with infinite time horizon and determining minimal mean cost cycles in a directed graph as decision support tool

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q623763)