A mathematical programming approach to a problem in variance penalised Markov decision processes (Q1317531): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Successive Underestimation Method for Concave Minimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variance-Penalized Markov Decision Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3285991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Fixed Charge Problem by Ranking the Extreme Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational approaches to variance-penalised Markov decision processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variance minimization problem for a Markov decision process / rank
 
Normal rank
Property / cites work
 
Property / cites work: VARIANCE CONSTRAINED MARKOV DECISION PROCESS / rank
 
Normal rank

Latest revision as of 13:41, 22 May 2024

scientific article
Language Label Description Also known as
English
A mathematical programming approach to a problem in variance penalised Markov decision processes
scientific article

    Statements

    A mathematical programming approach to a problem in variance penalised Markov decision processes (English)
    0 references
    0 references
    0 references
    17 March 1994
    0 references
    0 references
    variance
    0 references
    average expected reward
    0 references
    \(\varepsilon\)-optimal solution
    0 references
    0 references