Algorithms for solving stochastic discrete optimal control problems on networks
Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica, no. 3 (2014), pp. 80-88
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
In this paper we consider the stationary stochastic discrete optimal control problem with average cost criterion. We formulate this problem on networks and propose polynomial time algorithms for determining the optimal control by using a linear programming approach.
[1] Bellman R., “Functional equations in the theory of dynamic programming, XI-Limit theorems”, Rand. Circolo Math. Palermo, 8:3 (1959), 343–345 | DOI | MR
[2] Lozovanu D., Pickl S., “Algorithmic solution of discrete control problems on stochastic networks”, Procceedings of CTW09 Workshop on Graphs and Combinatorial Optimization, Paris, 2009, 221–224
[3] Puterman M., Markov Decision Processes: Stochastic Dynamic Programming, John Wiley, New Jersey, 2005
[4] Khachian L. G., “Polynomial time algorithm in linear programming”, USSR Computational Mathematics and Mathematical Phisics, 20:1 (1980), 51–68 | MR | Zbl