Conditions for the solvability of the linear programming formulation for constrained discounted Markov decision processes (Q315764)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Conditions for the solvability of the linear programming formulation for constrained discounted Markov decision processes |
scientific article; zbMATH DE number 6629424
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Conditions for the solvability of the linear programming formulation for constrained discounted Markov decision processes |
scientific article; zbMATH DE number 6629424 |
Statements
Conditions for the solvability of the linear programming formulation for constrained discounted Markov decision processes (English)
0 references
23 September 2016
0 references
Markov decision processes
0 references
linear programming formulation
0 references
constrained problems
0 references
0 references
0.8343400359153748
0 references
0.833394467830658
0 references
0.830247700214386
0 references
0.8298560380935669
0 references
