Algorithms - Linear Programming
V(s) ³ E[R(s,a)] + g Ss’eS d(s,a,s’) V(s’)
MAXIMIZE SseS V(s) , such that
"aeA s e S:
Variables: |S| variables
Inequalities: |S| |A|
Previous slide
Next slide
Back to first slide
View graphic version