The Linear Programming Approach to Approximate Dynamic Programming

The curse of dimensionality gives rise to prohibitive computational requirements that render infeasible the exact solution of large-scale stochastic control problems. We study an efficient method based on linear programming for approximating solutions to such problems. The approach "fits"...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Operations research Ročník 51; číslo 6; s. 850 - 865
Hlavní autori:	de Farias, D. P, Van Roy, B
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Linthicum INFORMS 01.11.2003 Institute for Operations Research and the Management Sciences
Predmet:	Algorithms Approximation Approximation theory Average cost Dynamic programming Dynamic programming/optimal control: approximations/large-scale problems Error bounds Liapunov functions Linear programming Machine learning Mathematical vectors Methods Operations research Process controls Queueing networks Queues, algorithms: control of queueing networks Queuing Studies
ISSN:	0030-364X, 1526-5463
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!