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-6zbMath1204.90108OpenAlexW2074425623MaRDI QIDQ623763

Stefan Pickl, Dmitrii D. 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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Related Items (1)

On qualitatively consistent, transitive and contradictory judgment matrices emerging from multiattribute decision procedures

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• An approach for an algorithmic solution of discrete optimal control problems and their game-theoretical extension
• A characterization of the minimum cycle mean in a digraph
• 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
• Optimization and Multiobjective Control of Time-Discrete Systems
• ON A NEW APPROACH TO THE NUMERICAL SOLUTION OF A CLASS OF PARTIAL DIFFERENTIAL INTEGRAL EQUATIONS OF TRANSPORT THEORY

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