No label defined (Q3737255)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3970555
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3970555 |
Statements
1983
0 references
non-stationary Markov processes
0 references
decision-making
0 references
additional linear constraints
0 references
randomized policies
0 references
normalized flow function
0 references
dynamic graph
0 references
0.7659385204315186
0 references
0.7611278295516968
0 references
0.7577700614929199
0 references
0.7552229166030884
0 references
A class of non-stationary Markov processes for decision-making (MPDM) is investigated, which has: additional linear constraints connecting the probabilities for going into different states at various moments of time when making certain decisions; the eigenvalue of MPDM, introduced with the help of a non-negative rational flow function v. The decisions optimal choice is reduced to a linear programming problem and it is realized by randomized policies and strategies. It is proved that each MPDM with linear constraints and a flow function v may be represented as an MPDM with a normalized flow function \(v=1\), analog linear constraints and coordinated incomes and coefficients in the left sides of these constraints. The conditions are defined, that allow the use of all the results obtained for MPDM with linear constraints in the case of analog MPDM with a flow function. It is proved that an arbitrary MPDM with linear constraints and a flow- function may be simply represented as a flow with linear capacity constraints on a dynamic graph. The necessary and sufficient conditions are given for the existence of an MPDM with linear constraints - with and without a flow function. It is proved that MPDM with linear constraints and a flow function is a more general mathematical structure than MPDM with the same constraints but without a flow function, the latter class of processes being a partial case of the first.
0 references